667 search results - page 67 / 134 » Approximation algorithms for connected facility location pro... |
100
click to vote
SODA
2000
ACM
15 years 1 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
77
Voted
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
111
Voted
ICALP
2009
Springer
16 years 25 days ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
112
click to vote
EUROCOLT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...