628 search results - page 27 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
160
Voted
FAW
2010
Springer
15 years 2 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
130
Voted
MONET
2006
15 years 2 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
132
Voted
TCAD
2008
15 years 2 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
154
click to vote
FSTTCS
2003
Springer
15 years 7 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...
130
click to vote
FSTTCS
2010
Springer
15 years 16 days ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...