632 search results - page 52 / 127 » On the Approximability of the Steiner Tree Problem |
178
Voted
ESA
2005
Springer
15 years 11 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
160
click to vote
ICALP
2009
Springer
16 years 18 days ago
2009
Springer
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
227
Voted
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
149
Voted
APPROX
2007
Springer
16 years 5 hour ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
146
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...