628 search results - page 32 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
116
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
143
click to vote
DISOPT
2010
15 years 2 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
131
Voted
ISPD
2010
ACM
15 years 9 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
151
Voted
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
121
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...