Skip to main content
SpringerLink
Log in

Analysis of Experimental Algorithms

Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Ilias Kotsireas

    1. Wilfrid Laurier University, Waterloo, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Panos Pardalos

    1. University of Florida, Gainesville, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Konstantinos E. Parsopoulos

    1. University of Ioannina, Ioannina, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Dimitris Souravlias

    1. Delft University of Technology, Delft, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Arsenis Tsokas

    1. University of Florida, Gainesville, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11544)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SEA 2019.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (35 papers)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Voronoi Diagram of Orthogonal Polyhedra in Two and Three Dimensions

    • Ioannis Z. Emiris, Christina Katsamaki
    Pages 1-20

  3. The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation

    • Tınaz Ekim, Mordechai Shalom, Oylum Şeker
    Pages 21-34

  4. Computing a Minimum Color Path in Edge-Colored Graphs

    • Neeraj Kumar
    Pages 35-50

  5. Student Course Allocation with Constraints

    • Akshay Utture, Vedant Somani, Prem Krishnaa, Meghana Nasre
    Pages 51-68

  6. A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem

    • Noé Godinho, Luís Paquete
    Pages 69-81

  7. Navigating a Shortest Path with High Probability in Massive Complex Networks

    • Jun Liu, Yicheng Pan, Qifu Hu, Angsheng Li
    Pages 82-97

  8. Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs

    • Glencora Borradaile, Hung Le, Baigong Zheng
    Pages 98-113

  9. On New Rebalancing Algorithm

    • Koba Gelashvili, Nikoloz Grdzelidze, Mikheil Tutberidze
    Pages 114-124

  10. Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs

    • Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka
    Pages 125-141

  11. Unit Disk Cover for Massive Point Sets

    • Anirban Ghosh, Brian Hicks, Ronald Shevchenko
    Pages 142-157

  12. Improved Contraction Hierarchy Queries via Perfect Stalling

    • Stefan Funke, Thomas Mendel
    Pages 158-166

  13. Constraint Generation Algorithm for the Minimum Connectivity Inference Problem

    • Édouard Bonnet, Diana-Elena Fălămaş, Rémi Watrigant
    Pages 167-183

  14. Efficient Split-Radix and Radix-4 DCT Algorithms and Applications

    • Sirani M. Perera, Daniel Silverio, Austin Ogle
    Pages 184-201

  15. 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, Fabiano Baldo
    Pages 202-218

  16. Computing Treewidth via Exact and Heuristic Lists of Minimal Separators

    • Hisao Tamaki
    Pages 219-236

  17. Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling

    • Duc-Minh Phan, Laurent Viennot
    Pages 237-247

  18. Effective Heuristics for Matchings in Hypergraphs

    • Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar
    Pages 248-264

  19. Approximated ZDD Construction Considering Inclusion Relations of Models

    • Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, Norihito Yasuda
    Pages 265-282

  20. Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem

    • Josef Malík, Ondřej Suchý, Tomáš Valla
    Pages 283-299Open Access
Back to top

Other volumes

  1. Analysis of Experimental Algorithms

Keywords

About this book

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.

Editors and Affiliations

  • Wilfrid Laurier University, Waterloo, Canada

    Ilias Kotsireas

  • University of Florida, Gainesville, USA

    Panos Pardalos, Arsenis Tsokas

  • University of Ioannina, Ioannina, Greece

    Konstantinos E. Parsopoulos

  • Delft University of Technology, Delft, The Netherlands

    Dimitris Souravlias

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation