509 search results - page 7 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
124
Voted
SIAMCOMP
2008
15 years 3 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
129
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
108
Voted
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
131
Voted
SODA
2010
ACM
16 years 26 days ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
137
Voted
IPL
2002
15 years 3 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...