A quasi-polynomial time approximation scheme for minimum weight triangulation.

Jan Remy Angelika Steger

Published in: J. ACM (2009)

Keyphrases

polynomial time approximation
minimum weight
np hard
approximation algorithms
greedy heuristic
error bounds
bipartite graph
spanning tree
weighted graph
bin packing
tree patterns
computational complexity
worst case
optimal solution
minimum cost
multi class
special case