Intersecting ellipses induced by a max-sum matching

DOI10.1007/s10898-023-01312-warXiv2212.14200MaRDI QIDQ6154397

Aleksandr A. Polyanskii, Polina Barabanshchikova

Publication date: 15 February 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.14200

zbMATH Keywords

convex optimizationTverberg theoremalternating cycleinfinite descentmax-sum matching

Mathematics Subject Classification ID

Metric geometry (51F99) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumerative combinatorics (05A99) Discrete geometry (52C99) Mathematical programming (90Cxx)

Cites Work

• Drawing Hamiltonian cycles with no large angles
• Tverberg's theorem, disks, and Hamiltonian cycles
• On generalizations of Radon's theorem and the Ham sandwich theorem
• On minimum stars and maximum matchings.
• Matching points with disks with a common intersection
• On maximum-sum matchings of points
• A Generalization of Radon's Theorem
• Partitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theorem
• Intersecting diametral balls induced by a geometric graph
• Unnamed Item

This page was built for publication: Intersecting ellipses induced by a max-sum matching