Combinatorial Optimization and Graph Algorithms Communications of NII Shonan Meetings
Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms. Contributions are by renowned researchers who attended NII Shonan m...
| Other Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Singapore
Springer Nature Singapore
2017, 2017
|
| Edition: | 1st ed. 2017 |
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems
- Graph Stabilization: A Survey
- Spider Covering Algorithms for Network Design problems
- Discrete Convex Functions on Graphs and Their Algorithmic Applications
- Parameterized Complexity of the Workflow Satisfiability Problem