2252 search results - page 80 / 451 » Lower Bounds for Dynamic Algorithms |
118
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
129
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
112
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
COCOON
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
STOC
1995
ACM
15 years 5 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...