628 search results - page 38 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
128
Voted
SIGCOMM
2000
ACM
15 years 7 months ago
2000
ACM
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...
211
Voted
ACID
2006
15 years 4 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
140
Voted
SIAMCOMP
2008
15 years 2 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
154
Voted
ALGOSENSORS
2009
Springer
15 years 9 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
130
Voted
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...