7150 search results - page 95 / 1430 » An Approximation Algorithm for Approximation Rank |
103
Voted
FOCS
2002
IEEE
15 years 7 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...
93
Voted
ICCAD
2007
IEEE
15 years 11 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
123
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
100
click to vote
JAL
2002
15 years 2 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
140
click to vote
NETWORKS
2002
15 years 2 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...