17 search results - page 2 / 4» Approximation Schemes for Minimum 2-Connected Spanning Subgr... |

DISOPT

2010

13 years 5 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...

SODA

1998

ACM

13 years 6 months ago
1998

ACM

Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...

ALGORITHMICA

2005

13 years 5 months ago
2005

A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...

STACS

2001

Springer

13 years 10 months ago
2001

Springer

We consider the problem of computing an optimal range assignment in a wireless network which allows a speciﬁed source station to perform a broadcast operation. In particular, we ...

APPROX

2009

Springer

14 years 1 days ago
2009

Springer

We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...