15254 search results - page 313 / 3051 » A k |
183
click to vote
WAOA
2007
Springer
16 years 27 days ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
139
click to vote
AAECC
2006
Springer
16 years 23 days ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
158
click to vote
FIWAC
1993
15 years 11 months ago
1993
Systems (Extended Abstract) Noga Alon ∗ Benny Sudakov Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel A dis...
145
click to vote
DM
2008
15 years 6 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
153
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...