179 search results - page 6 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
MOR
2000
13 years 7 months ago
2000
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...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...