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...
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | , |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Singapore :
Springer Singapore : Imprint: Springer,
2017.
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.