34 search results - page 3 / 7 » Minimum dilation stars |
STACS
2007
Springer
14 years 5 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
DCOSS
2011
Springer
12 years 10 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
APPROX
2007
Springer
14 years 5 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 ...
OPODIS
2008
14 years 9 days ago
2008
Most peer-to-peer (P2P) networks proposed until now have either logarithmic degree and logarithmic dilation or constant degree and logarithmic dilation. In the latter case (which i...
GC
2010
Springer
13 years 9 months ago
2010
Springer
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph