Unfairly splitting separable necklaces
From MaRDI portal
Cites work
- A Moment Problem in L 1 Approximation
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- A structural approach to kernels for ILPs: treewidth and total unimodularity
- Algorithmic solutions for envy-free cake cutting
- An Envy-Free Cake Division Protocol
- An FPT algorithm for splitting a necklace among two thieves
- Bisection of Circle Colorings
- Complexity results on a paint shop problem.
- Complexity results on restricted instances of a paint shop problem for words
- Computational complexity of the -Ham-Sandwich problem
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Envy-Free Division of Land
- Generalized sandwich theorems
- Generalized ham-sandwich cuts
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- Paintshop, odd cycles and necklace splitting
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
- Splitting necklaces
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- The complexity of splitting necklaces and bisecting ham sandwiches
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Two choices are enough for P-LCPs, USOs, and colorful tangents
- Well-separation and hyperplane transversals in high dimensions
This page was built for publication: Unfairly splitting separable necklaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287811)
