433 search results - page 12 / 87 » A greedy approximation algorithm for the group Steiner probl... |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
APPROX
2004
Springer
14 years 24 days ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
ANOR
2010
13 years 4 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
DAC
1995
ACM
13 years 11 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...