skip to main content
Skip header Section
Geometry of Cuts and MetricsDecember 2009
Publisher:
  • Springer Publishing Company, Incorporated
ISBN:978-3-642-04294-2
Published:02 December 2009
Pages:
587
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, distance geometry, combinatorial matrix theory, statistical physics, VLSI design etc. A main feature of this book is its interdisciplinarity. The book contains a wealth of results, from different mathematical disciplines, which are presented here in a unified and comprehensive manner. Geometric representations and methods turn out to be the linking theme. This book will provide a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the interdisciplinarity of these fields as it gathers methods and results from polytope theory, geometry of numbers, probability theory, design and graph theory around two objects, cuts and metrics. [ ] The book is very nicely written [ ] The book is also very well structured. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [ ] In my opinion, the book is a beautiful piece of work. The longer one works with it, the more beautiful it becomes." Robert Weismantel, Optima 56 (1997) " In short, this is a very interesting book which is nice to have." Alexander I. Barvinok, MR 1460488 (98g:52001) " This is a large and fascinating book. As befits a book which contains material relevant to so many areas of mathematics (and related disciplines such as statistics, physics, computing science, and economics), it is self-contained and written in a readable style. Moreover, the index, bibliography, and table of contents are all that they should be in such a work; it is easy to find as much or as little introductory material as needed." R.Dawson, Zentralblatt MATH Database 0885.52001

Cited By

  1. Kaparis K, Letchford A and Mourtos I (2023). On cut polytopes and graph minors, Discrete Optimization, 50:C, Online publication date: 1-Nov-2023.
  2. Muthu S, Tennakoon R, Rathnayake T, Hoseinnezhad R, Suter D and Bab-Hadiashar A (2023). Generalized framework for image and video object segmentation using affinity learning and message passing GNNS, Computer Vision and Image Understanding, 236:C, Online publication date: 1-Nov-2023.
  3. Del Pia A and Walter M Simple Odd -Cycle Inequalities for Binary Polynomial Optimization Integer Programming and Combinatorial Optimization, (181-194)
  4. Djeumou Fomeni F, Kaparis K and Letchford A (2022). A cut-and-branch algorithm for the Quadratic Knapsack Problem, Discrete Optimization, 44:P2, Online publication date: 1-May-2022.
  5. Kaparis K, Letchford A and Mourtos I (2022). Generalised 2-circulant inequalities for the max-cut problem, Operations Research Letters, 50:2, (122-128), Online publication date: 1-Mar-2022.
  6. Kunisky D and Bandeira A (2021). A tight degree 4 sum-of-squares lower bound for the Sherrington–Kirkpatrick Hamiltonian, Mathematical Programming: Series A and B, 190:1-2, (721-759), Online publication date: 1-Nov-2021.
  7. Galli L and Letchford A (2021). Valid inequalities for quadratic optimisation with domain constraints, Discrete Optimization, 41:C, Online publication date: 1-Aug-2021.
  8. Fiorini S, Macchia M and Pashkovich K (2021). Bounds on the Number of 2-Level Polytopes, Cones, and Configurations, Discrete & Computational Geometry, 65:3, (587-600), Online publication date: 1-Apr-2021.
  9. Yang Q, Li Y and Huang P (2020). A novel formulation of the max-cut problem and related algorithm, Applied Mathematics and Computation, 371:C, Online publication date: 15-Apr-2020.
  10. Musin O (2019). Graphs and spherical two-distance sets, European Journal of Combinatorics, 80:C, (311-325), Online publication date: 1-Aug-2019.
  11. Chepoi V, Labourel A and Ratel S (2019). On density of subgraphs of halved cubes, European Journal of Combinatorics, 80:C, (57-70), Online publication date: 1-Aug-2019.
  12. Klavžar S and Mollard M (2019). Daisy cubes and distance cube polynomial, European Journal of Combinatorics, 80:C, (214-223), Online publication date: 1-Aug-2019.
  13. Neto J and Ben-Ameur W (2019). On fractional cut covers, Discrete Applied Mathematics, 265:C, (168-181), Online publication date: 31-Jul-2019.
  14. Khot S and Naor A The Andoni-Krauthgamer-Razenshteyn characterization of sketchable norms fails for sketchable metrics Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (1814-1824)
  15. Bach F Efficient algorithms for non-convex isotonic regression through submodular optimization Proceedings of the 32nd International Conference on Neural Information Processing Systems, (1-10)
  16. Petrovsky A (2018). Indicators of Similarity and Dissimilarity of Multi-Attribute Objects in the Metric Spaces of Sets and Multisets, Scientific and Technical Information Processing, 45:5, (331-345), Online publication date: 1-Dec-2018.
  17. Kaparis K and Letchford A (2018). A note on the 2-circulant inequalities for the max-cut problem, Operations Research Letters, 46:4, (443-447), Online publication date: 1-Jul-2018.
  18. Rmer T and Saeedi Madani S (2018). Retracts and algebraic properties of cut algebras, European Journal of Combinatorics, 69:C, (214-236), Online publication date: 1-Mar-2018.
  19. Culbertson J, Guralnik D and Stiller P (2018). Functorial hierarchical clustering with overlaps, Discrete Applied Mathematics, 236:C, (108-123), Online publication date: 19-Feb-2018.
  20. ACM
    Chan T and Jiang S (2018). Reducing Curse of Dimensionality, ACM Transactions on Algorithms, 14:1, (1-18), Online publication date: 30-Jan-2018.
  21. Chepoi V (2017). Distance-Preserving Subgraphs of Johnson Graphs, Combinatorica, 37:6, (1039-1055), Online publication date: 1-Dec-2017.
  22. Pogodin R, Krechetov M and Maximov Y Efficient rank minimization to tighten semidefinite programming for unconstrained binary quadratic optimization 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), (1153-1159)
  23. Glantz R and Meyerhenke H (2017). On finding convex cuts in general, bipartite and plane graphs, Theoretical Computer Science, 695:C, (54-73), Online publication date: 26-Sep-2017.
  24. Horňáková A, Lange J and Andres B Analysis and optimization of graph decompositions by lifted multicuts Proceedings of the 34th International Conference on Machine Learning - Volume 70, (1539-1548)
  25. Hungerländer P (2017). New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem, Discrete Applied Mathematics, 217:P1, (19-39), Online publication date: 30-Jan-2017.
  26. Cevallos A, Eisenbrand F and Zenklusen R Local search for max-sum diversification Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (130-142)
  27. Natarajan K and Teo C (2017). On reduced semidefinite programs for second order moment bounds with applications, Mathematical Programming: Series A and B, 161:1-2, (487-518), Online publication date: 1-Jan-2017.
  28. ACM
    Chan T, Gupta A, Maggs B and Zhou S (2016). On Hierarchical Routing in Doubling Metrics, ACM Transactions on Algorithms, 12:4, (1-22), Online publication date: 2-Sep-2016.
  29. Chan T and Jiang S Reducing curse of dimensionality Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, (754-765)
  30. ACM
    Fiorini S, Massar S, Pokutta S, Tiwary H and de Wolf R (2015). Exponential Lower Bounds for Polytopes in Combinatorial Optimization, Journal of the ACM, 62:2, (1-23), Online publication date: 6-May-2015.
  31. ACM
    Khot S and Vishnoi N (2015). The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1, Journal of the ACM, 62:1, (1-39), Online publication date: 2-Mar-2015.
  32. Neto J (2014). On the polyhedral structure of uniform cut polytopes, Discrete Applied Mathematics, 175, (62-70), Online publication date: 1-Oct-2014.
  33. Bonato T, Jünger M, Reinelt G and Rinaldi G (2014). Lifting and separation procedures for the cut polytope, Mathematical Programming: Series A and B, 146:1-2, (351-378), Online publication date: 1-Aug-2014.
  34. ACM
    Solomon J, Rustamov R, Guibas L and Butscher A (2014). Earth mover's distances on discrete surfaces, ACM Transactions on Graphics, 33:4, (1-12), Online publication date: 27-Jul-2014.
  35. Weller A, Tang K, Sontag D and Jebara T Understanding the Bethe approximation Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, (868-877)
  36. Sitharam M and Willoughby J On Flattenability of Graphs Revised Selected Papers of the 10th International Workshop on Automated Deduction in Geometry - Volume 9201, (129-148)
  37. Laurent M and Varvitsiotis A (2014). A new graph parameter related to bounded rank positive semidefinite matrix completions, Mathematical Programming: Series A and B, 145:1-2, (291-325), Online publication date: 1-Jun-2014.
  38. Ohsugi H (2014). Gorenstein cut polytopes, European Journal of Combinatorics, 38:C, (122-129), Online publication date: 1-May-2014.
  39. Hungerländer P and Rendl F (2018). A computational study and survey of methods for the single-row facility layout problem, Computational Optimization and Applications, 55:1, (1-20), Online publication date: 1-May-2013.
  40. Chandrasekaran V, Recht B, Parrilo P and Willsky A (2012). The Convex Geometry of Linear Inverse Problems, Foundations of Computational Mathematics, 12:6, (805-849), Online publication date: 1-Dec-2012.
  41. Yarkony J, Ihler A and Fowlkes C Fast planar correlation clustering for image segmentation Proceedings of the 12th European conference on Computer Vision - Volume Part VI, (568-581)
  42. Sontag D, Choe D and Li Y Efficiently searching for frustrated cycles in MAP inference Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, (795-804)
  43. ACM
    Fiorini S, Massar S, Pokutta S, Tiwary H and de Wolf R Linear vs. semidefinite extended formulations Proceedings of the forty-fourth annual ACM symposium on Theory of computing, (95-106)
  44. Laurent M and Varvitsiotis A The gram dimension of a graph Proceedings of the Second international conference on Combinatorial Optimization, (356-367)
  45. Galli L, Kaparis K and Letchford A Gap inequalities for the max-cut problem Proceedings of the Second international conference on Combinatorial Optimization, (178-188)
  46. Chierichetti F and Kumar R LSH-preserving functions and their applications Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, (1078-1094)
  47. Chan T and Elbassioni K (2011). A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics, Discrete & Computational Geometry, 46:4, (704-723), Online publication date: 1-Dec-2011.
  48. Heinemann U and Globerson A What cannot be learned with Bethe approximations Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, (319-326)
  49. Rauh J, Kahle T and Ay N (2011). Support sets in exponential families and oriented matroid theory, International Journal of Approximate Reasoning, 52:5, (613-626), Online publication date: 1-Jul-2011.
  50. ACM
    Joshi S, Kommaraji R, Phillips J and Venkatasubramanian S Comparing distributions and shapes using the kernel distance Proceedings of the twenty-seventh annual symposium on Computational geometry, (47-56)
  51. Schmitzer B and Schnörr C Weakly convex coupling continuous cuts and shape priors Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision, (423-434)
  52. Neto J (2011). From equipartition to uniform cut polytopes, Discrete Mathematics, 311:8-9, (705-714), Online publication date: 1-May-2011.
  53. Catusse N, Chepoi V and Vaxès Y (2011). Embedding into the rectilinear plane in optimal O(n2) time, Theoretical Computer Science, 412:22, (2425-2433), Online publication date: 1-May-2011.
  54. Gottlieb L and Krauthgamer R A nonlinear approach to dimension reduction Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (888-899)
  55. Petrovsky A (2018). Methods for the group classification of multi-attribute objects (part 1), Scientific and Technical Information Processing, 37:5, (346-356), Online publication date: 1-Dec-2010.
  56. Bavaud F Euclidean distances, soft and spectral clustering on weighted graphs Proceedings of the 2010th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I, (103-118)
  57. Buchheim C, Liers F and Oswald M (2019). Speeding up IP-based algorithms for constrained quadratic 0---1 optimization, Mathematical Programming: Series A and B, 124:1-2, (513-535), Online publication date: 1-Jul-2010.
  58. Letchford A Integer quadratic quasi-polyhedra Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization, (258-270)
  59. ACM
    Chan T, Gupta A and Talwar K (2010). Ultra-low-dimensional embeddings for doubling metrics, Journal of the ACM (JACM), 57:4, (1-26), Online publication date: 1-Apr-2010.
  60. Lee J and Raghavendra P (2019). Coarse Differentiation and Multi-flows in Planar Graphs, Discrete & Computational Geometry, 43:2, (346-362), Online publication date: 1-Mar-2010.
  61. Rendl F, Rinaldi G and Wiegele A (2019). Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations, Mathematical Programming: Series A and B, 121:2, (307-335), Online publication date: 1-Feb-2010.
  62. Chan T and Elbassioni K A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (256-267)
  63. Edmonds J, Sidiropoulos A and Zouzias A Inapproximability for planar embedding problems Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (222-235)
  64. Jayram T Hellinger Strikes Back Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, (562-573)
  65. ACM
    Moraglio A and Borenstein Y A gaussian random field model of smooth fitness landscapes Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, (171-182)
  66. Ovchinnikov S (2008). Partial cubes, Discrete Mathematics, 308:23, (5597-5621), Online publication date: 1-Dec-2008.
  67. Buchheim C, Liers F and Oswald M A basic toolbox for constrained quadratic 0/1 optimization Proceedings of the 7th international conference on Experimental algorithms, (249-262)
  68. Georgiou K, Magen A and Tourlakis I Vertex cover resists SDPs tightened by local hypermetric inequalities Proceedings of the 13th international conference on Integer programming and combinatorial optimization, (140-153)
  69. Chang C, Lyuu Y and Ti Y Testing embeddability between metric spaces Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77, (117-124)
  70. Moraglio A, Di Chio C, Togelius J and Poli R (2008). Geometric particle swarm optimization, Journal of Artificial Evolution and Applications, 2008, (1-14), Online publication date: 1-Jan-2008.
  71. Bryant D and Dress A (2018). Linearly independent split systems, European Journal of Combinatorics, 28:6, (1814-1831), Online publication date: 1-Aug-2007.
  72. ACM
    Moraglio A and Togelius J Geometric particle swarm optimization for the sudoku puzzle Proceedings of the 9th annual conference on Genetic and evolutionary computation, (118-125)
  73. ACM
    Di Chio C, Moraglio A and Poli R Geometric particle swarm optimisation on binary and real spaces Proceedings of the 9th annual conference companion on Genetic and evolutionary computation, (2659-2666)
  74. Klavar S and Kovše M (2018). Partial cubes and their τ-graphs, European Journal of Combinatorics, 28:4, (1037-1042), Online publication date: 1-May-2007.
  75. Moraglio A, Di Chio C and Poli R Geometric particle swarm optimisation Proceedings of the 10th European conference on Genetic programming, (125-136)
  76. Dutour Sikirić M and Grishukhin V (2007). How to compute the rank of a Delaunay polytope, European Journal of Combinatorics, 28:3, (762-773), Online publication date: 1-Apr-2007.
  77. Santos F, Schürmann A and Vallentin F (2007). Lattice Delone simplices with super-exponential volume, European Journal of Combinatorics, 28:3, (801-806), Online publication date: 1-Apr-2007.
  78. Fukuda M, Braams B, Nakata M, Overton M, Percus J, Yamashita M and Zhao Z (2007). Large-scale semidefinite programs in electronic structure calculation, Mathematical Programming: Series A and B, 109:2-3, (553-580), Online publication date: 1-Mar-2007.
  79. Bazzi R and Konjevod G (2007). On the establishment of distinct identities in overlay networks, Distributed Computing, 19:4, (267-287), Online publication date: 1-Mar-2007.
  80. Brešar B and Klavar S (2019). Θ-graceful labelings of partial cubes, Discrete Mathematics, 306:13, (1264-1271), Online publication date: 1-Jul-2006.
  81. Moraglio A, Poli R and Seehuus R Geometric crossover for biological sequences Proceedings of the 9th European conference on Genetic Programming, (121-132)
  82. Huber K, Koolen J and Moulton V (2006). On the structure of the tight-span of a totally split-decomposable metric, European Journal of Combinatorics, 27:3, (461-479), Online publication date: 1-Apr-2006.
  83. Giandomenico M and Letchford A (2019). Exploring the Relationship Between Max-Cut and Stable Set Relaxations, Mathematical Programming: Series A and B, 106:1, (159-175), Online publication date: 1-Mar-2006.
  84. Chen X (2006). The Sylvester-Chvatal Theorem, Discrete & Computational Geometry, 35:2, (193-199), Online publication date: 1-Feb-2006.
  85. Schurmann A and Vallentin F (2019). Computational Approaches to Lattice Packing and Covering Problems, Discrete & Computational Geometry, 35:1, (73-116), Online publication date: 1-Jan-2006.
  86. Frangioni A, Lodi A and Rinaldi G (2005). New approaches for optimizing over the semimetric polytope, Mathematical Programming: Series A and B, 104:2-3, (375-388), Online publication date: 1-Nov-2005.
  87. ACM
    Bazzi R and Konjevod G On the establishment of distinct identities in overlay networks Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, (312-320)
  88. Cary M, Rudra A and Sabharwal A On the hardness of embeddings between two finite metrics Proceedings of the 32nd international conference on Automata, Languages and Programming, (1412-1423)
  89. Chan H, Gupta A, Maggs B and Zhou S On hierarchical routing in doubling metrics Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (762-771)
  90. Bartal Y, Linial N, Mendel M and Naor A (2019). Some Low Distortion Metric Ramsey Problems, Discrete & Computational Geometry, 33:1, (27-41), Online publication date: 1-Jan-2005.
  91. Bornstein C and Vempala S (2004). Flow metrics, Theoretical Computer Science, 321:1, (13-24), Online publication date: 16-Jun-2004.
  92. Gravier S, Klavžar S and Mollard M (2003). Isometric embeddings of subdivided wheels in hypercubes, Discrete Mathematics, 269:1-3, (287-293), Online publication date: 28-Jul-2003.
  93. Feige U and Schechtman G (2002). On the optimality of the random hyperplane rounding technique for max cut, Random Structures & Algorithms, 20:3, (403-440), Online publication date: 1-May-2002.
  94. Fukuda M and Kojima M (2019). Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem, Computational Optimization and Applications, 19:1, (79-105), Online publication date: 1-Apr-2001.
  95. Naor J and Rabani Y Tree packing and approximating k-cuts Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, (26-27)
  96. Barvinok A (2018). A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints, Discrete & Computational Geometry, 25:1, (23-31), Online publication date: 1-Jan-2001.
  97. Koolen J, Laurent M and Schrijver A (2019). Equilateral Dimension of the Rectilinear Space, Designs, Codes and Cryptography, 21:1-3, (149-164), Online publication date: 1-Oct-2000.
  98. Pan V and Yu Y Certified computation of the sign of a matrix determinant Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (715-724)
  99. ACM
    Linial N, Magen A and Saks M Trees and Euclidean metrics Proceedings of the thirtieth annual ACM symposium on Theory of computing, (169-175)
  100. Laurent M (2019). Cuts, matrix completions and graph rigidity, Mathematical Programming: Series A and B, 79:1-3, (255-283), Online publication date: 1-Oct-1997.
Contributors
  • University of Paris
  • Center for Mathematics and Computer Science - Amsterdam

Recommendations