Algorithms and Complexity 10th International Conference CIAC 2017 Athens Greece May 24 26 2017 Proceedings 1st Edition by Dimitris Fotakis 3319575864 9783319575865
Original price was: $50.00.$25.00Current price is: $25.00.
Algorithms and Complexity 10th International Conference CIAC 2017 Athens Greece May 24 26 2017 Proceedings 1st Edition by Dimitris Fotakis – Ebook Instant Download/Delivery ISBN(s): 3319575864, 9783319575865
Product details:
- ISBN 10: 3319575864
- ISBN 13: 9783319575865
- Author: Dimitris
This book constitutes the refereed conference proceedings of the 10th International Conference on Algorithms and Complexity, CIAC 2017, held in Athens, Greece, in May 2017. The 36 revised full papers were carefully reviewed and selected from 90 submissions and are presented together with 3 abstracts of invited talks and a paper to the 70th birthday of Stathis Zachos. The papers present original research in the theory and applications of algorithms and computational complexity.
Table of contents:
1. Extended Abstracts
TFNP: An Update
New Algorithmic Results for Bin Packing and Scheduling
2. Regular Papers
Scheduling Maintenance Jobs in Networks
Paths to Trees and Cacti
Temporal Flows in Temporal Networks
Completeness Results for Counting Problems with Easy Decision
Tracking Paths
On the Complexity of Finding a Potential Community
Improved Lower Bounds for Graph Embedding Problems
Collaboration Without Communication: Evacuating Two Robots from a Disk
Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
Assessing the Computational Complexity of Multi-layer Subgraph Detection
Almost Optimal Cover-Free Families
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
Parameterized Resiliency Problems via Integer Linear Programming
Push-Pull Block Puzzles are Hard
Weak Coverage of a Rectangular Barrier
Minimum Cost Perfect Matching with Delays for Two Sources
Congestion Games with Complementarities
Approximating Bounded Degree Deletion via Matroid Matching
Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
Cost-Sharing in Generalised Selfish Routing
Cache Oblivious Minimum Cut
Enumeration of Maximal Irredundant Sets for Claw-Free Graphs
Approximate Maximin Share Allocations in Matroids
Space-Efficient Euler Partition and Bipartite Edge Coloring
Minimum Point-Overlap Labeling
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
Structural Parameters for Scheduling with Assignment Restrictions
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games
Perpetually Dominating Large Grids
Rooted Uniform Monotone Minimum Spanning Trees
Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values
Linear Search with Terrain-Dependent Speeds
Linear-Time Generation of Random Chordal Graphs
Population Protocols with Faulty Interactions: The Impact of a Leader
3. Paper Dedicated to Stathis Zachos on the Occasion of his 70th Birthday
Stathis Zachos at 70!
People also search:
convex optimization algorithms and complexity
combinatorial optimization algorithms and complexity
cs 6505 computability algorithms and complexity
combinatorial optimization algorithms and complexity pdf
algorithms and complexity (cs 331)
You may also like…
Computers - Programming
Computers - Networking
