scientific article; zbMATH DE number 7053317
From MaRDI portal
Publication:5743438
zbMath1422.68317MaRDI QIDQ5743438
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095181
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searching for empty convex polygons
- Triangulations. Structures for algorithms and applications
- Polynomial-time instances of the minimum weight triangulation problem
- Computing a subgraph of the minimum weight triangulation
- A new subgraph of minimum weight triangulations
- A large subgraph of the minimum weight triangulation
- Triangulations intersect nicely
- The polytope of all triangulations of a point configuration
- Fast greedy triangulation algorithms.
- The minimum weight triangulation problem with few inner points
- FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
- A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators
- Minimum-weight triangulation is NP-hard
- Triangulations (tilings) and certain block triangular matrices
- A heuristic triangulation algorithm
- Minimal Triangulations of Polygonal Domains
- 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
- On exclusion regions for optimal triangulations
This page was built for publication:
