scientific article; zbMATH DE number 871937
From MaRDI portal
Publication:4875212
zbMATH Open0845.90124MaRDI QIDQ4875212FDOQ4875212
Authors: Drago Krznaric, Christos Levcopoulos 
Publication date: 28 April 1996
Title of this publication is not available (Why is that?)
Recommendations
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- scientific article; zbMATH DE number 742947
- A grid-based approximation algorithm for the minimum weight triangulation problem
- Approximating minimum-weight triangulations in three dimensions
- Approximating the minimum weight Steiner triangulation
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- On minimum weight pseudo-triangulations
- scientific article; zbMATH DE number 1496856
lower boundpolynomial time algorithmminimum weight triangulationgreedy triangulationworst-case approximation ratio
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (10)
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation
- Optimal computation of the Voronoi diagram of disjoint clusters
- Progress on maximum weight triangulation
- On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation
- Title not available (Why is that?)
- An almost four-approximation algorithm for maximum weight triangulation
- A study of the LMT-skeleton
- A fast heuristic for approximating the minimum weight triangulation
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- Triangulations intersect nicely
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875212)
