628 search results - page 104 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
131
Voted
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
152
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
138
click to vote
SOFSEM
2000
Springer
15 years 6 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
104
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
94
Voted
EUROCAST
2007
Springer
15 years 8 months ago
2007
Springer
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...