186 search results - page 5 / 38 » Improved approximation algorithms for directed Steiner fores... |
124
click to vote
APPROX
2007
Springer
15 years 10 months 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 ...
171
click to vote
FSTTCS
2003
Springer
15 years 9 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
301
click to vote
AAIM
2011
Springer
14 years 7 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
134
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...