3415 search results - page 554 / 683 » Lower bounds on kernelization |
144
click to vote
COCOON
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
168
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
183
click to vote
RANDOM
1998
Springer
15 years 10 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
179
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
168
click to vote
PODC
1997
ACM
15 years 10 months ago
1997
ACM
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...