2 search results - page 1 / 1 » NP-Completeness Results for Minimum Planar Spanners |
57
Voted
DMTCS
1998
14 years 10 months ago
1998
SIROCCO
2001
15 years 12 days ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...