OL
2010
12 years 11 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
DAM
1999
13 years 4 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
JSYML
2000
13 years 4 months ago
2000
We deal with several pcf problems; we characterize another version of exponentiation: number of -branches in a tree with nodes, deal with existence of independent sets in stable t...
JAL
2000
13 years 4 months ago
2000
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...
COMBINATORICS
2004
13 years 4 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
SIAMJO
2008
13 years 4 months ago
2008
Abstract. 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 . . ....
DAM
2008
13 years 4 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
ACTA
2008
13 years 4 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
UAI
1990
13 years 5 months ago
1990
We examine the notion of "unrelatedness" in a probabilistic framework. Three formulations are presented. In the first formulation, two variables a and b are totally inde...
FCT
2007
Springer
13 years 8 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...