↓ Skip to main content

Combinatorial Optimization and Applications

Overview of attention for book
Cover of 'Combinatorial Optimization and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Going Weighted: Parameterized Algorithms for Cluster Editing
  3. Altmetric Badge
    Chapter 2 Combinatorial Optimization and Applications
  4. Altmetric Badge
    Chapter 3 Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
  5. Altmetric Badge
    Chapter 4 Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
  6. Altmetric Badge
    Chapter 5 Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
  7. Altmetric Badge
    Chapter 6 A Parameterized Perspective on Packing Paths of Length Two
  8. Altmetric Badge
    Chapter 7 New Algorithms for k -Center and Extensions
  9. Altmetric Badge
    Chapter 8 Separating Sublinear Time Computations by Approximate Diameter
  10. Altmetric Badge
    Chapter 9 Computational Study on Dominating Set Problem of Planar Graphs
  11. Altmetric Badge
    Chapter 10 Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
  12. Altmetric Badge
    Chapter 11 Parameterized Algorithms for Generalized Domination
  13. Altmetric Badge
    Chapter 12 Turán Graphs, Stability Number, and Fibonacci Index
  14. Altmetric Badge
    Chapter 13 Vertex-Uncertainty in Graph-Problems
  15. Altmetric Badge
    Chapter 14 Protean Graphs with a Variety of Ranking Schemes
  16. Altmetric Badge
    Chapter 15 Simplicial Powers of Graphs
  17. Altmetric Badge
    Chapter 16 On k - Versus ( k  + 1)-Leaf Powers
  18. Altmetric Badge
    Chapter 17 Flows with Unit Path Capacities and Related Packing and Covering Problems
  19. Altmetric Badge
    Chapter 18 Strong Formulations for 2-Node-Connected Steiner Network Problems
  20. Altmetric Badge
    Chapter 19 Algorithms and Implementation for Interconnection Graph Problem
  21. Altmetric Badge
    Chapter 20 Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
  22. Altmetric Badge
    Chapter 21 Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
  23. Altmetric Badge
    Chapter 22 Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks
  24. Altmetric Badge
    Chapter 23 Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
  25. Altmetric Badge
    Chapter 24 Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
  26. Altmetric Badge
    Chapter 25 Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
  27. Altmetric Badge
    Chapter 26 Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
  28. Altmetric Badge
    Chapter 27 An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
  29. Altmetric Badge
    Chapter 28 Covering Arrays Avoiding Forbidden Edges
  30. Altmetric Badge
    Chapter 29 The Robot Cleans Up
  31. Altmetric Badge
    Chapter 30 On Recovering Syntenic Blocks from Comparative Maps
  32. Altmetric Badge
    Chapter 31 Automatic Generation of Symmetry-Breaking Constraints
  33. Altmetric Badge
    Chapter 32 On the Stable Set Polytope of Claw-Free Graphs
  34. Altmetric Badge
    Chapter 33 A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
  35. Altmetric Badge
    Chapter 34 Magic Labelings on Cycles and Wheels
  36. Altmetric Badge
    Chapter 35 Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
  37. Altmetric Badge
    Chapter 36 The Clique Corona Operation and Greedoids
  38. Altmetric Badge
    Chapter 37 On the Surface Area of the ( n , k )-Star Graph
  39. Altmetric Badge
    Chapter 38 Enumerating Isolated Cliques in Synthetic and Financial Networks
  40. Altmetric Badge
    Chapter 39 A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
  41. Altmetric Badge
    Chapter 40 Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
  42. Altmetric Badge
    Chapter 41 Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
  43. Altmetric Badge
    Chapter 42 Stochastic Online Scheduling Revisited
  44. Altmetric Badge
    Chapter 43 Delay Management Problem: Complexity Results and Robust Algorithms
  45. Altmetric Badge
    Chapter 44 Clustered SplitsNetworks
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
11 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Combinatorial Optimization and Applications
Published by
Springer Berlin Heidelberg, August 2008
DOI 10.1007/978-3-540-85097-7
ISBNs
978-3-54-085096-0, 978-3-54-085097-7
Editors

Yang, Boting, Du, Ding-Zhu, Wang, Cao An

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 11 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 9%
Librarian 1 9%
Unknown 9 82%
Readers by discipline Count As %
Arts and Humanities 1 9%
Engineering 1 9%
Unknown 9 82%