Results 1  10
of
52
Online Colored Bin Packing
, 2014
"... In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to be packed into bins of unit capacity. Each item has one of c ≥ 2 colors and an additional constraint is that we cannot pack two items of the same color next to each other in the same bin. The objective is to minimize ..."
Abstract
 Add to MetaCart
In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to be packed into bins of unit capacity. Each item has one of c ≥ 2 colors and an additional constraint is that we cannot pack two items of the same color next to each other in the same bin. The objective is to minimize
Bin Packing Game with an Interest Matrix
"... Abstract. In this paper we study a game problem, called bin packing game with an interest matrix, which is a generalization of all the currently known bin packing games. In this game, there are some items with positive sizes and identical bins with unit capacity as in the classical bin packing prob ..."
Abstract
 Add to MetaCart
Abstract. In this paper we study a game problem, called bin packing game with an interest matrix, which is a generalization of all the currently known bin packing games. In this game, there are some items with positive sizes and identical bins with unit capacity as in the classical bin packing
On bin packing with conflicts
 IN PROCEEDINGS OF THE 4TH WORKSHOP ON AAPPROXIMATION AND ONLINE ALGORITHMS (WAOA
, 2006
"... We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2,..., n} with sizes s1, s2..., sn ∈ [0, 1] and a conflict graph G = (V, E), the goal is to find a partition of the items into independent sets of G, where the total ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
the total size of each independent set is at most one, so that the number of independent sets in the partition is minimized. This problem is clearly a generalization of both the classical (onedimensional) bin packing problem where E = ∅ and of the graph coloring problem where si = 0 for all i = 1, 2
Selfish bin packing
 IN ESA ’08: PROCEEDINGS OF THE SIXTEENTH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS
, 2008
"... Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by selfish agents. Each agent is charged with a cost according to the fraction of the used bin space its item requires. That ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by selfish agents. Each agent is charged with a cost according to the fraction of the used bin space its item requires
Online bincoloring
 In Proceedings of the 9th European Symposium on Algorithms (ESA
, 2001
"... We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored items into bins, such that the maximum number of different colors per bin is minimized. Each bin has size B 2 N. The packi ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored items into bins, such that the maximum number of different colors per bin is minimized. Each bin has size B 2 N
Bin Packing via Discrepancy of Permutations
, 2011
"... A well studied special case of bin packing is the 3partition problem, where n items of size> 1 have to be packed in 4 a minimum number of bins of capacity one. The famous KarmarkarKarp algorithm transforms a fractional solution of a suitable LP relaxation for this problem into an integral solut ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
A well studied special case of bin packing is the 3partition problem, where n items of size> 1 have to be packed in 4 a minimum number of bins of capacity one. The famous KarmarkarKarp algorithm transforms a fractional solution of a suitable LP relaxation for this problem into an integral
An APTAS for the VariableSized Bin Packing Problem With Color Constraints
, 2005
"... We consider the VariableSized Bin Packing Problem With Color Constraints (VBPCC). In this problem we have an unbounded number of bins, each one with size in {w1,...,wk}, a list of items L, each item e ∈ L with size se and color ce. The objective is to pack the items of L into bins, such that no bin ..."
Abstract
 Add to MetaCart
We consider the VariableSized Bin Packing Problem With Color Constraints (VBPCC). In this problem we have an unbounded number of bins, each one with size in {w1,...,wk}, a list of items L, each item e ∈ L with size se and color ce. The objective is to pack the items of L into bins
A Minimum Taxrate Core Allocation of Bin Packing Games
, 1999
"... This paper deals with a class of cooperative games called bin packing games. We give a precise definition of bin packing games in the next section. In [1], Faige and Kern showed that every bin packing game has nonempty (1/2)core and constructed a ..."
Abstract
 Add to MetaCart
This paper deals with a class of cooperative games called bin packing games. We give a precise definition of bin packing games in the next section. In [1], Faige and Kern showed that every bin packing game has nonempty (1/2)core and constructed a
Efficient Graph Packing via Game Coloring
, 2008
"... The game coloring number gcol(G) of a graph G is the least k such that if two players take turns choosing the vertices of a graph then either of them can insure that every vertex has less than k neighbors chosen before it, regardless of what choices the other player makes. Clearly gcol(G) ≤ ∆(G) + ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The game coloring number gcol(G) of a graph G is the least k such that if two players take turns choosing the vertices of a graph then either of them can insure that every vertex has less than k neighbors chosen before it, regardless of what choices the other player makes. Clearly gcol(G) ≤ ∆(G
Online interval coloring with packing constraints
 IN PROCEEDINGS OF THE 30TH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (MFCS’05), LNCS 3618
, 2005
"... We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider openend coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider openend coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality
Results 1  10
of
52