Combinatorial Algorithms
Springer International Publishing (Verlag)
978-3-030-48965-6 (ISBN)
The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.
Coordinating swarms of objects at extreme dimensions.- A family of tree-based generators for bubbles in directed graphs.- The micro-world of cographs.- Parameterized Complexity of (A,`)-Path Packing.- On Proper Labellings of Graphs with Minimum Label Sum.- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework.- On the Complexity of Stackelberg Matroid Pricing Problems.- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten.- Edge-Disjoint Branchings in Temporal Graphs.- Optimal In-place Algorithms for Basic Graph Problems.- Further Results on Online Node- and Edge-Deletion Problems with Advice.- Fair packing of independent sets.- Polynomial Time Algorithms for Tracking Path Problems.- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride.- Iterated Type Partitions.- Two Robots Patrolling on a Line: Integer Version and Approximability.- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges.- On the Complexity of Singly Connected Vertex Deletion.- Equitable d-degenerate choosability of graphs.- On the complexity of Broadcast Domination and Multipacking in digraphs.- A Parameterized Perspective on Attacking and Defending Elections.- Skyline Computation with Noisy Comparisons.- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings.- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions.- The Steiner problem for count matroids.- Bounded Degree Group Steiner problems.- Between proper and strong edge-colorings of subcubic graphs.- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination.- Algorithms for Constructing Anonymizing Arrays.- Parameterized algorithms for partial vertex covers in bipartite graphs.- Acyclic Matching in Some Subclasses of Graphs.
| Erscheinungsdatum | 30.05.2020 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIX, 424 p. 120 illus., 29 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 676 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik | |
| Schlagworte | Algorithm analysis and problem complexity • algorithms and data structures • Applications • approximation algorithms • Approximation Theory • Artificial Intelligence • Bipartite Graphs • circuits and Boolean functions • Coloring • combinatorial optimization • Combinatorial Problems • Complexity theory • computational algebra and geometry • Computational Biology • Computer Science • Computer systems • computer vision • conference proceedings • data structures • Directed graphs • Distributed and Parallel Algorithms • Engineering • graph drawing and labelling • graph g • Graphic methods • graph theory • Graph theory and combinatorics • Informatics • Mathematics • Mobile Agents • polynomial approximation • Research • Signal Processing • theoretical computer science • weighted graph |
| ISBN-10 | 3-030-48965-5 / 3030489655 |
| ISBN-13 | 978-3-030-48965-6 / 9783030489656 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
