↓ Skip to main content

Integer Programming and Combinatorial Optimization

Overview of attention for book
Cover of 'Integer Programming and Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On the Structure of Reduced Kernel Lattice Bases
  3. Altmetric Badge
    Chapter 2 All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
  4. Altmetric Badge
    Chapter 3 Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
  5. Altmetric Badge
    Chapter 4 Intersection Cuts for Mixed Integer Conic Quadratic Sets
  6. Altmetric Badge
    Chapter 5 Content Placement via the Exponential Potential Function Method
  7. Altmetric Badge
    Chapter 6 Equivariant Perturbation in Gomory and Johnson’s Infinite Group Problem: II. The Unimodular Two-Dimensional Case
  8. Altmetric Badge
    Chapter 7 Blocking Optimal Arborescences
  9. Altmetric Badge
    Chapter 8 Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
  10. Altmetric Badge
    Chapter 9 A Complexity and Approximability Study of the Bilevel Knapsack Problem
  11. Altmetric Badge
    Chapter 10 Matroid and Knapsack Center Problems
  12. Altmetric Badge
    Chapter 11 Cut-Generating Functions
  13. Altmetric Badge
    Chapter 12 Reverse Chvátal-Gomory Rank
  14. Altmetric Badge
    Chapter 13 On Some Generalizations of the Split Closure
  15. Altmetric Badge
    Chapter 14 Packing Interdiction and Partial Covering Problems
  16. Altmetric Badge
    Chapter 15 On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
  17. Altmetric Badge
    Chapter 16 An Improved Integrality Gap for Asymmetric TSP Paths
  18. Altmetric Badge
    Chapter 17 Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
  19. Altmetric Badge
    Chapter 18 A Stochastic Probing Problem with Applications
  20. Altmetric Badge
    Chapter 19 Thrifty Algorithms for Multistage Robust Optimization
  21. Altmetric Badge
    Chapter 20 Shallow-Light Steiner Arborescences with Vertex Delays
  22. Altmetric Badge
    Chapter 21 Two Dimensional Optimal Mechanism Design for a Sequencing Problem
  23. Altmetric Badge
    Chapter 22 Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
  24. Altmetric Badge
    Chapter 23 A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets
  25. Altmetric Badge
    Chapter 24 The Complexity of Scheduling for p-Norms of Flow and Stretch
  26. Altmetric Badge
    Chapter 25 The Euclidean k-Supplier Problem
  27. Altmetric Badge
    Chapter 26 Facial Structure and Representation of Integer Hulls of Convex Sets
  28. Altmetric Badge
    Chapter 27 An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem
  29. Altmetric Badge
    Chapter 28 Chain-Constrained Spanning Trees
  30. Altmetric Badge
    Chapter 29 A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing
  31. Altmetric Badge
    Chapter 30 0/1 Polytopes with Quadratic Chvátal Rank
  32. Altmetric Badge
    Chapter 31 Eight-Fifth Approximation for the Path TSP
  33. Altmetric Badge
    Chapter 32 Fast Deterministic Algorithms for Matrix Completion Problems
  34. Altmetric Badge
    Chapter 33 Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
Attention for Chapter 31: Eight-Fifth Approximation for the Path TSP
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (87th percentile)
  • High Attention Score compared to outputs of the same age and source (96th percentile)

Mentioned by

blogs
1 blog
twitter
1 X user
wikipedia
1 Wikipedia page

Readers on

mendeley
7 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
Eight-Fifth Approximation for the Path TSP
Chapter number 31
Book title
Integer Programming and Combinatorial Optimization
Published in
arXiv, March 2013
DOI 10.1007/978-3-642-36694-9_31
Book ISBNs
978-3-64-236693-2, 978-3-64-236694-9
Authors

András Sebő, András Sebö, Sebő, András

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 14%
Unknown 6 86%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 29%
Researcher 2 29%
Student > Bachelor 1 14%
Unknown 2 29%
Readers by discipline Count As %
Computer Science 5 71%
Unknown 2 29%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 11. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 22 January 2019.
All research outputs
#2,769,145
of 22,678,224 outputs
Outputs from arXiv
#49,683
of 929,249 outputs
Outputs of similar age
#26,203
of 215,806 outputs
Outputs of similar age from arXiv
#243
of 6,523 outputs
Altmetric has tracked 22,678,224 research outputs across all sources so far. Compared to these this one has done well and is in the 87th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 929,249 research outputs from this source. They receive a mean Attention Score of 3.9. This one has done particularly well, scoring higher than 94% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 215,806 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 87% of its contemporaries.
We're also able to compare this research output to 6,523 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 96% of its contemporaries.