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

Jan Remy Angelika Steger

Published in: STOC (2006)

Keyphrases

polynomial time approximation
minimum weight
np hard
approximation algorithms
greedy heuristic
error bounds
bipartite graph
special case
weighted graph
spanning tree
bin packing
learning algorithm
optimal solution