628 search results - page 42 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
113
Voted
ALENEX
2001
15 years 4 months ago
2001
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
163
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
115
Voted
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
133
Voted
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
133
Voted
ADHOCNOW
2005
Springer
15 years 8 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...