NP-Completness Results for Minimum Planar Spanners.

Ulrik Brandes Dagmar Handke

Published in: WG (1997)

Keyphrases

computational complexity
np complete
np hard
simple polygon
global minimum
database
information retrieval
artificial intelligence
information systems
decision trees
three dimensional
d objects
line drawings
minimum cost
square error
double exponential