↓ Skip to main content

Approximation Algorithms for Combinatorial Optimization

Overview of attention for book
Cover of 'Approximation Algorithms for Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Search and Classification of High Dimensional Data
  3. Altmetric Badge
    Chapter 2 Bicriteria Spanning Tree Problems
  4. Altmetric Badge
    Chapter 3 Improved Approximation Algorithms for Multilevel Facility Location Problems
  5. Altmetric Badge
    Chapter 4 On Constrained Hypergraph Coloring and Scheduling
  6. Altmetric Badge
    Chapter 5 On the Power of Priority Algorithms for Facility Location and Set Cover
  7. Altmetric Badge
    Chapter 6 Two Approximation Algorithms for 3-Cycle Covers
  8. Altmetric Badge
    Chapter 7 Approximation Algorithms for the Unsplittable Flow Problem
  9. Altmetric Badge
    Chapter 8 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
  10. Altmetric Badge
    Chapter 9 Typical Rounding Problems
  11. Altmetric Badge
    Chapter 10 Approximating Min-sum Set Cover
  12. Altmetric Badge
    Chapter 11 Approximating Maximum Edge Coloring in Multigraphs
  13. Altmetric Badge
    Chapter 12 Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees
  14. Altmetric Badge
    Chapter 13 A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
  15. Altmetric Badge
    Chapter 14 Facility Location and the Geometric Minimum-Diameter Spanning Tree
  16. Altmetric Badge
    Chapter 15 Improved Approximation Algorithms for the Partial Vertex Cover Problem
  17. Altmetric Badge
    Chapter 16 Minimum Restricted Diameter Spanning Trees
  18. Altmetric Badge
    Chapter 17 Hardness of Approximation for Vertex-Connectivity Network-Design Problems
  19. Altmetric Badge
    Chapter 18 Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem
  20. Altmetric Badge
    Chapter 19 Routing and Admission Control in Networks with Advance Reservations
  21. Altmetric Badge
    Chapter 20 Improved Approximation Algorithms for Metric Facility Location Problems
  22. Altmetric Badge
    Chapter 21 Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products
  23. Altmetric Badge
    Chapter 22 Primal-Dual Algorithms for Connected Facility Location Problems
Attention for Chapter 13: A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
4 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.
Chapter title
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
Chapter number 13
Book title
Approximation Algorithms for Combinatorial Optimization
Published by
Springer, Berlin, Heidelberg, September 2002
DOI 10.1007/3-540-45753-4_13
Book ISBNs
978-3-54-044186-1, 978-3-54-045753-4
Authors

Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michał Małafiejski, Giaro, Krzysztof, Janczewski, Robert, Kubale, Marek, Małafiejski, Michał

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Brazil 1 25%
Unknown 3 75%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 25%
Professor > Associate Professor 1 25%
Student > Bachelor 1 25%
Lecturer 1 25%
Readers by discipline Count As %
Computer Science 2 50%
Mathematics 1 25%
Agricultural and Biological Sciences 1 25%