3875 search results - page 169 / 775 » Approximation algorithms for the 0-extension problem |
132
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
137
click to vote
IQIS
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem...
148
Voted
SIAMCOMP
2008
15 years 4 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
151
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
143
click to vote
SIAMJO
2008
15 years 4 months ago
2008
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...