628 search results - page 47 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
142
click to vote
DAM
2006
15 years 3 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
179
click to vote
MOBIHOC
2012
ACM
13 years 5 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
144
click to vote
IPL
2002
15 years 2 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
114
click to vote
CCCG
2007
15 years 4 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
120
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...