Sciweavers

7006 search results - page 134 / 1402
» Approximation Algorithms
Sort
View
ESA
2010
Springer
144views Algorithms» more  ESA 2010»
15 years 3 months ago
Approximation Schemes for Multi-Budgeted Independence Systems
Fabrizio Grandoni, Rico Zenklusen
131
Voted
MOR
2000
90views more  MOR 2000»
15 years 2 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
103
Voted
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 2 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
134
Voted
SOFTWARE
2002
15 years 2 months ago
A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
Rolf Haenni
118
Voted
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
15 years 2 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...