2714 search results - page 21 / 543 » Approximation Schemes for Scheduling |
SODA
1997
ACM
15 years 1 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
98
Voted
TC
2008
15 years 8 days ago
2008
Collaborative applications with energy and low-delay constraints are emerging in various networked embedded systems like wireless sensor networks and multimedia terminals. Conventi...
89
Voted
AAAI
2008
15 years 2 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
90
Voted
JCSS
2008
15 years 10 days ago
2008
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
94
Voted
MSWIM
2004
ACM
15 years 5 months ago
2004
ACM
— Providing delay guarantees to time-sensitive traffic in future wireless multimedia networks is a challenging issue. This is due to the time-varying link capacities and the vari...