Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
From MaRDI portal
Publication:2373932
DOI10.1007/s00373-007-0716-1zbMath1123.52007OpenAlexW2039080572MaRDI QIDQ2373932
Sambuddha Roy, William Steiger
Publication date: 19 July 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0716-1
Analysis of algorithms and problem complexity (68Q25) Partitions of sets (05A18) (n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Combinatorics in computer science (68R05)
Related Items (8)
Bisecting envelopes of convex polygons ⋮ A survey of mass partitions ⋮ Generalized ham-sandwich cuts ⋮ Fault-tolerant spanners in networks with symmetric directional antennas ⋮ Ham-sandwich cuts for abstract order types ⋮ Computing balanced islands in two colored point sets in the plane ⋮ Points with large \(\alpha \)-depth ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geodesic ham-sandwich cuts
- Splitting necklaces
- An equipartition of planar sets
- Algorithms for ham-sandwich cuts
- Balanced convex partitions of measures in \(\mathbb R^{2}\)
- Improved bounds for planar \(k\)-sets and related problems
- Generalizing ham sandwich cuts to equitable subdivisions
- Equipartition of two measures by a 4-fan
- Balanced partitions of two sets of points in the plane
- Equipartitions of measures by 2-fans
- Bisection of Circle Colorings
- Partitioning with two lines in the plane
- On k-Hulls and Related Problems
- Partitioning Space for Range Queries
- An Optimal-Time Algorithm for Slope Selection
- Polygon Retrieval
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- Weighted Ham-Sandwich Cuts
- Simultaneous partitions of measures by \(k\)-fans
- An improved bound for \(k\)-sets in three dimensions
This page was built for publication: Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
