Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12757)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: IWOCA 2021.
Buy print copy
About this book
This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format.
The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.
Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via springerlink.bibliotecabuap.elogim.com.
Similar content being viewed by others
Keywords
- approximation algorithms
- artificial intelligence
- bipartite graphs
- combinatorial algorithms
- combinatorial mathematics
- combinatorial optimization
- directed graphs
- graph g
- graph theory
- graphic methods
- polynomial approximation
- signal processing
- vertex set
- weighted graph
- wireless telecommunication systems
Table of contents (40 papers)
-
Front Matter
-
Invited Papers
-
Front Matter
-
-
Contributed Papers
-
Front Matter
-
Other volumes
-
Combinatorial Algorithms
Editors and Affiliations
Bibliographic Information
Book Title: Combinatorial Algorithms
Book Subtitle: 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings
Editors: Paola Flocchini, Lucia Moura
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-79987-8
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2021
Softcover ISBN: 978-3-030-79986-1Published: 30 June 2021
eBook ISBN: 978-3-030-79987-8Published: 30 June 2021
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XX, 588
Number of Illustrations: 75 b/w illustrations, 59 illustrations in colour
Topics: Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity, Data Structures, Computer Graphics