A new asymmetric inclusion region for minimum weight triangulation
From MaRDI portal
Publication:2655340
DOI10.1007/s10898-009-9409-zzbMath1181.90223OpenAlexW1987001724MaRDI QIDQ2655340
Publication date: 25 January 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9409-z
Cites Work
- Unnamed Item
- New results on MWT subgraphs
- Applications of a new space-partitioning technique
- Cutting hyperplanes for divide-and-conquer
- Computing a subgraph of the minimum weight triangulation
- A new subgraph of minimum weight triangulations
- A large subgraph of the minimum weight triangulation
- The greedy triangulation can be computed from the Delaunay triangulation in linear time
- The minimum weight triangulation problem with few inner points
- Minimum-weight triangulation is NP-hard
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
- DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations
- On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation
This page was built for publication: A new asymmetric inclusion region for minimum weight triangulation
