2976 search results - page 119 / 596 » On the bounded integer programming |
135
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
98
Voted
CPC
2000
15 years 2 months ago
2000
We examine the specialization to simple matroids of certain problems in extremal matroid theory that are concerned with bounded cocircuit size. Assume that each cocircuit of a simp...
111
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
193
Voted
PODC
1993
ACM
15 years 6 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
140
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...