Results 21 to 30 of about 4,092 (253)
CoRR, 2015 We study the Colored Bin Packing Problem: we are given a set of items where each item has a weight and color. We must pack the items in bins of uniform capacity such that no two items of the same color may be adjacent within in a bin. The goal is to perform this packing using the fewest number of bins.
Hamza Alsarhan +4 more
openaire +2 more sources
Online Colored Bin Packing [PDF]
, 2015 Added lower bound of 2.5 for at least three colors, expanded some ...
Martin Böhm 0001 +2 more
openaire +2 more sources
Bin Packing with Multiple Colors
CoRR, 2015 In the Colored Bin Packing problem a set of items with varying weights and colors must be packed into bins of uniform weight limit such that no two items of the same color may be packed adjacently within a bin. We solve this problem for the case where there are two or more colors when the items have zero weight and when the items have unit weight.
Hamza Alsarhan +4 more
openaire +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
, 2014 We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size s_i \in [0,1] and a color c_i \in C, where C is a set of colors (that is not necessarily known in advance).
György Dósa, Leah Epstein
openaire +2 more sources
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
Compressed Subsequence Matching and Packed Tree Coloring [PDF]
Algorithmica, 2014 We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $σ$, our algorithm uses $O(n+\frac{nσ}{w})$ space and $O(n+\frac{nσ}{w}+m\log N\log w\cdot occ)$ or $O(n+\frac{nσ}{w}\log w+m\log N\cdot occ)$ time ...
Philip Bille +2 more
openaire +4 more sources
The packing coloring problem for lobsters and partner limited graphs [PDF]
, 2014 A packing k-coloring of a graph G is a k-coloring such that the distance between two vertices having color i is at least i + 1. To compute the packing chromatic number is NP-hard, even restricted to trees, and it is known to be polynomial time solvable ...
Torres, Pablo Daniel +2 more
core +1 more source
On The Packing k-Coloring of Unicyclic Graph Family [PDF]
, 2020 All graph in this paper is connected graph. Let du,v be a distance between any vertex u and v in graph GV,E. A function c :VG 1, 2, , k is called a packing k coloring if every two vertex of color i are at least distance i 1.
KRISTIANA, Arika Indah +2 more
core
, 2022 Pakirno barvanje grafe je dobro barvanje vozlišč, pri katerem sta poljubni dve vozlišči z isto barvo i na razdalji večji kot i. Pakirno kromatično število je najmanjše število barv, ki jih potrebujemo za tako barvanje grafa.
Ličina, Tomaž
core