119 search results - page 12 / 24 » Linear-Time Algorithms for Parametric Minimum Spanning Tree ... |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
GD
2004
Springer
14 years 26 days ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
DISOPT
2010
13 years 7 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...
AINA
2007
IEEE
14 years 1 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
WINET
2010
13 years 5 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...