| Description |
1 online resource (xi, 564 pages) : illustrations (some color) |
| Series |
Lecture notes in computer science ; 11544 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 11544.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Voronoi diagram of orthogonal polyhedra in two and three dimensions / Ioannis Z. Emiris and Christina Katsamaki -- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation / Tınaz Ekim, Mordechai Shalom, and Oylum Şeker -- Computing a minimum color path in edge-colored graphs / Neeraj Kumar -- Student course allocation with constraints / Akshay Utture, Vedant Somani, Prem Krishnaa, and Meghana Nasre -- A combinatorial branch and bound for the min-max regret spanning tree problem / Noé Godinho and Luís Paquete -- Navigating a shortest path with high probability in massive complex networks / Jun Liu, Yicheng Pan, Qifu Hu, and Angsheng Li -- Engineering a PTAS for minimum feedback vertex set in planar graphs / Glencora Borradaile, Hung Le, and Baigong Zheng -- On new rebalancing algorithm / Koba Gelashvili, Nikoloz Grdzelidze, and Mikheil Tutberidze -- Colorful frontier-based search : implicit enumeration of chordal and interval subgraphs / Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, and Ryo Yoshinaka -- Unit disk cover for massive point sets / Anirban Ghosh, Brian Hicks, and Ronald Shevchenko -- Improved contraction hierarchy queries via perfect stalling / Stefan Funke and Thomas Mendel -- Constraint generation algorithm for the minimum connectivity inference problem / Édouard Bonnet, Diana-Elena Fălămaş, and Rémi Watrigant -- Efficient split-Radix and Radix-4 DCT algorithms and applications / Sirani M. Perera, Daniel Silverio, and Austin Ogle -- Analysis of max-min ant system with local search applied to the asymmetric and dynamic travelling salesman problem with moving vehicle / João P. Schmitt, Rafael S. Parpinelli, and Fabiano Baldo -- Computing treewidth via exact and heuristic lists of minimal separators / Hisao Tamaki |
|
Fast public transit routing with unrestricted walking through hub labeling / Duc-Minh Phan and Laurent Viennot -- Effective heuristics for matchings in hypergraphs / Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, and Bora Uçar -- Approximated ZDD construction considering inclusion relations of models / Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, and Norihito Yasuda -- Efficient implementation of color coding algorithm for subgraph isomorphism problem / Josef Malík, Ondřej Suchý, and Tomáš Valla -- Quantum-inspired evolutionary algorithms for covering arrays of arbitrary strength / Michael Wagner, Ludwig Kampel, and Dimitris E. Simos -- An experimental study of algorithsm for deodesic shortest paths in the constant-workplace model / Jonas Cleve and Wolfgang Mulzer -- Searching for best Karatsuba recurrences / Çağdaş Çalık, Morris Dworkin, Nathan Dykas, and Rene Peralta -- Minimum and maximum category constraints in the orienteering problem with time windows / Konstantinos Ameranis, Nikolaos Vathis, and Dimitris Fotakis -- Internal versus external balancing in the evaluation of graph-based number types / Hanna Geppert and Martin Wilhelm -- Hacker's multiple-precision integer-division program in close scrutiny / Jyrki Katajainen -- Assessing algorithm parameter importance using global sensitivity analysis / Alessio Greco, Salvatore Danilo Riccio, Jon Timmis, and Giuseppe Nicosia -- A machine learning framework for volume prediction / Umutcan Önal and Zafeirakis Zafeirakopoulos -- Fast biclique mining in near-bipartite graphs / Blair D. Sullivan, Andrew van der Poel, and Trey Woodlief -- k-maximum subarrays for small k : divide-and-conquer made simpler / Ovidiu Daescu and Hemant Malik |
|
A faster convex-hull algorithm via bucketing / Ask Neve Gamby and Jyrki Katajainen -- Fixed set search applied to the minimum weighted vertex cover problem / Raka Jovanovic and Stefan Voß -- Automated deep learning for threat detection in luggage from x-ray images / Alessio Petrozziello and Ivan Jordanov -- Algorithmic aspects on the construction of separating codes / Marcel Fernandez and John Livieratos -- Lagrangian relaxation in iterated local search for the workplace scheduling and routing problem / Hanyu Gu, Yefei Zhang, and Yakov Zinder -- Approximation algorithms and an integer program for multi-level graph spanners / Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen Kobourov, Faryad Darabi Sahneh, and Richard Spence |
| Summary |
This book constitutes the refereed post-conference proceedings of the Special Event on the Analysis of Experimental Algorithms, SEA² 2019, held in Kalamata, Greece, in June 2019. The 35 revised full papers presented were carefully reviewed and selected from 45 submissions. The papers cover a wide range of topics in both computer science and operations research/mathematical programming. They focus on the role of experimentation and engineering techniques in the design and evaluation of algorithms, data structures, and computational optimization methods. -- Provided by publisher |
| Notes |
Includes author index |
|
Online resource; title from PDF title page (SpringerLink, viewed November 19, 2019) |
| Subject |
Computer algorithms -- Congresses
|
|
Computer algorithms
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Kotsireas, Ilias, editor.
|
|
Pardalos, P. M. (Panos M.), 1954- editor
|
|
Parsopoulos, Konstantinos E., 1974- editor.
|
|
Souravlias, Dimitris, editor
|
|
Tsokas, Arsenis, editor
|
| ISBN |
9783030340292 |
|
3030340295 |
|
