628 search results - page 76 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
131
click to vote
ESA
2008
Springer
15 years 4 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 ...
122
click to vote
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
136
click to vote
PPAM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
120
click to vote
PDPTA
2007
15 years 4 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
130
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...