7006 search results - page 38 / 1402 » Approximation Algorithms |
118
Voted
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
135
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
140
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
139
click to vote
PPAM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
187
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...