Cover Image

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...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Fukunaga, Takuro. (Editor, http://id.loc.gov/vocabulary/relators/edt), Kawarabayashi, Ken-ichi. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Language:English
Published: Singapore : Springer Singapore : Imprint: Springer, 2017.
Edition:1st ed. 2017.
Subjects:
Computer science—Mathematics.
Discrete mathematics.
Operations research.
Decision making.
Discrete Mathematics in Computer Science.
Discrete Mathematics.
Operations Research/Decision Theory.
Online Access:https://doi.org/10.1007/978-981-10-6147-9
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.

Similar Items