1671 search results - page 60 / 335 » On the Covering Steiner Problem |
186
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
198
click to vote
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
137
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
206
click to vote
ISAAC
2000
Springer
15 years 10 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
141
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...