Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9472)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: ISAAC 2015.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (65 papers)
-
Front Matter
-
Combinatorial Optimization and Approximation Algorithms I
-
Front Matter
-
-
Combinatorial Optimization and Approximation Algorithms II
-
Front Matter
-
Other volumes
-
Algorithms and Computation
Keywords
- combinatorial optimization
- cryptography
- online algorithms
- parallel algorithms
- quantum computing
- algorithmic game theory
- algorithms
- approximation
- approximation algorithms
- computational biology
- computational complexity
- computational geometry
- data structures
- distributed algorithms
- experimental algorithms
- graph algorithms
- graph drawing
- internet algorithms
- polynomial time
- randomized algorithms
- algorithm analysis and problem complexity
About this book
This book constitutes the refereed proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015, held in Nagoya, Japan, in December 2015.
The 65 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 180 submissions for inclusion in the book. The focus of the volume is on the following topics: computational geometry; data structures; combinatorial optimization and approximation algorithms; randomized algorithms; graph algorithms and FPT; computational complexity; graph drawing and planar graphs; online and streaming algorithms; and string and DNA algorithms.
Editors and Affiliations
Bibliographic Information
Book Title: Algorithms and Computation
Book Subtitle: 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings
Editors: Khaled Elbassioni, Kazuhisa Makino
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-662-48971-0
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2015
Softcover ISBN: 978-3-662-48970-3Published: 27 November 2015
eBook ISBN: 978-3-662-48971-0Published: 07 December 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XXII, 793
Number of Illustrations: 131 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Computer Graphics, Data Structures, Numeric Computing