Results 31 to 40 of about 254,850 (275)
Online Interval Coloring with Packing Constraints [PDF]
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Epstein, Leah, Levy, Meital
openaire +2 more sources
On Colorful Bin Packing Games [PDF]
, 2018 We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of $m\geq 2$ colors and cannot be packed next to an item of the same color. All bins have the same unitary cost which is shared among the items it contains, so that players are ...
Vittorio Bilò +3 more
openaire +5 more sources
On S-Packing Coloring of Subcubic Graphs [PDF]
Given a sequence $S = (s_1, s_2, \ldots, s_k)$ of positive integers with $s_1 \leq s_2 \leq \ldots \leq s_k$, an $S$-packing coloring of a graph $G$ is a partition of $V(G)$ into $k$ subsets $V_1, V_2, \ldots, V_k$ such that for each $1 \leq i \leq k$ the distance between any two distinct $x, y \in V_i$ is at least $s_i + 1$.
Hadeel Al Bazzal
openalex +3 more sources
S-Packing Colorings of Cubic Graphs [PDF]
, 2016 Given a non-decreasing sequence $S=(s\_1,s\_2, \ldots, s\_k)$ of positive integers, an {\em $S$-packing coloring} of a graph $G$ is a mapping $c$ from $V(G)$ to $\{s\_1,s\_2, \ldots, s\_k\}$ such that any two vertices with color $s\_i$ are at mutual ...
Gastineau, Nicolas, Togni, Olivier
core +2 more sources
Approximating Bin Packing within O(log OPT * log log OPT) bins [PDF]
, 2013 For bin packing, the input consists of n items with sizes s_1,...,s_n in [0,1] which have to be assigned to a minimum number of bins of size 1. The seminal Karmarkar-Karp algorithm from '82 produces a solution with at most OPT + O(log^2 OPT) bins.
Rothvoss, Thomas
core +1 more source
Fast Parallel Fixed-Parameter Algorithms via Color Coding [PDF]
, 2015 Fixed-parameter algorithms have been successfully applied to solve numerous difficult problems within acceptable time bounds on large inputs. However, most fixed-parameter algorithms are inherently \emph{sequential} and, thus, make no use of the parallel
Bannach, Max +2 more
core +2 more sources
J@ti Undip: Jurnal Teknik Industri, 2013 Batik Saud Effendy merupakan salah satu IKM batik di Kampoeng Batik Laweyan, Surakarta. Jenis batik yang diproduksi adalah batik cap dan batik tulis dengan sebagian besar jenis batik yang diproduksi adalah batik cap.
Dyah Ika Rinawati +2 more
doaj +1 more source
Counterintuitive ground states in soft-core models [PDF]
, 2008 It is well known that statistical mechanics systems exhibit subtle behavior in high dimensions. In this paper, we show that certain natural soft-core models, such as the Gaussian core model, have unexpectedly complex ground states even in relatively low ...
Cohn, Henry, Kumar, Abhinav
core +1 more source
Frontiers in Plant Science, 2017 Sweet cherries are attractive fruits due to their taste, color, nutritional value, and beneficial health effects. Sweet cherry is a highly perishable fruit and all quality attributes and the level of health promoting compounds are affected by growth ...
Sofia Correia +3 more
doaj +1 more source
Coloring translates and homothets of a convex body [PDF]
, 2009 We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finite families of translates and homothets of a convex body in $\RR^n$.Comment:
A. Gyárfás +14 more
core +3 more sources