↓ 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 Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
  3. Altmetric Badge
    Chapter 2 Centerpoints: A Link Between Optimization and Convex Geometry
  4. Altmetric Badge
    Chapter 3 Rescaled Coordinate Descent Methods for Linear Programming
  5. Altmetric Badge
    Chapter 4 Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
  6. Altmetric Badge
    Chapter 5 Max-Cut Under Graph Constraints
  7. Altmetric Badge
    Chapter 6 Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
  8. Altmetric Badge
    Chapter 7 Intersection Cuts for Bilevel Optimization
  9. Altmetric Badge
    Chapter 8 Exact Algorithms for the Chance-Constrained Vehicle Routing Problem
  10. Altmetric Badge
    Chapter 9 Extended Formulations in Mixed-integer Convex Programming
  11. Altmetric Badge
    Chapter 10 k-Trails: Recognition, Complexity, and Approximations
  12. Altmetric Badge
    Chapter 11 Better s-t-Tours by Gao Trees
  13. Altmetric Badge
    Chapter 12 Popular Edges and Dominant Matchings
  14. Altmetric Badge
    Chapter 13 Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines
  15. Altmetric Badge
    Chapter 14 Stabilizing Network Bargaining Games by Blocking Players
  16. Altmetric Badge
    Chapter 15 Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over
  17. Altmetric Badge
    Chapter 16 Extreme Functions with an Arbitrary Number of Slopes
  18. Altmetric Badge
    Chapter 17 Minimal Cut-Generating Functions are Nearly Extreme
  19. Altmetric Badge
    Chapter 18 On the Mixed Binary Representability of Ellipsoidal Regions
  20. Altmetric Badge
    Chapter 19 Constant Factor Approximation for ATSP with Two Edge Weights
  21. Altmetric Badge
    Chapter 20 Improved Approximation Algorithms for Hitting 3-Vertex Paths
  22. Altmetric Badge
    Chapter 21 Improved Approximations for Cubic Bipartite and Cubic TSP
  23. Altmetric Badge
    Chapter 22 An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
  24. Altmetric Badge
    Chapter 23 Valid Inequalities for Separable Concave Constraints with Indicator Variables
  25. Altmetric Badge
    Chapter 24 A Polyhedral Approach to Online Bipartite Matching
  26. Altmetric Badge
    Chapter 25 On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank
  27. Altmetric Badge
    Chapter 26 Robust Monotone Submodular Function Maximization
  28. Altmetric Badge
    Chapter 27 Maximizing Monotone Submodular Functions over the Integer Lattice
  29. Altmetric Badge
    Chapter 28 Submodular Unsplittable Flow on Trees
  30. Altmetric Badge
    Chapter 29 Strong Reductions for Extended Formulations
  31. Altmetric Badge
    Chapter 30 Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations
  32. Altmetric Badge
    Chapter 31 Approximation-Friendly Discrepancy Rounding
  33. Altmetric Badge
    Chapter 32 Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
  34. Altmetric Badge
    Chapter 33 On the Quantile Cut Closure of Chance-Constrained Problems
Attention for Chapter 19: Constant Factor Approximation for ATSP with Two Edge Weights
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

twitter
2 X users

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 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
Constant Factor Approximation for ATSP with Two Edge Weights
Chapter number 19
Book title
Integer Programming and Combinatorial Optimization
Published in
arXiv, June 2016
DOI 10.1007/978-3-319-33461-5_19
Book ISBNs
978-3-31-933460-8, 978-3-31-933461-5
Authors

Ola Svensson, Jakub Tarnawski, László A. Végh

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users 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 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Computer Science 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 05 September 2017.
All research outputs
#18,430,915
of 22,833,393 outputs
Outputs from arXiv
#534,545
of 937,483 outputs
Outputs of similar age
#254,583
of 338,942 outputs
Outputs of similar age from arXiv
#7,978
of 15,697 outputs
Altmetric has tracked 22,833,393 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 937,483 research outputs from this source. They receive a mean Attention Score of 3.9. This one is in the 28th percentile – i.e., 28% of its peers scored the same or lower than it.
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 338,942 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 14th percentile – i.e., 14% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 15,697 others from the same source and published within six weeks on either side of this one. This one is in the 31st percentile – i.e., 31% of its contemporaries scored the same or lower than it.