Sciweavers

OL
2010
140views more  OL 2010»
13 years 6 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
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...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
DAM
1999
105views more  DAM 1999»
13 years 11 months ago
The b-chromatic Number of a Graph
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...
Robert W. Irving, David Manlove
JSYML
2000
71views more  JSYML 2000»
13 years 11 months ago
Applications of PCF Theory
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...
Saharon Shelah
JAL
2000
119views more  JAL 2000»
13 years 11 months ago
On Markov Chains for Independent Sets
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...
Martin E. Dyer, Catherine S. Greenhill
COMBINATORICS
2004
129views more  COMBINATORICS 2004»
13 years 11 months ago
Operations on Well-Covered Graphs and the Roller-Coaster Conjecture
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...
Philip Matchett
SIAMJO
2008
175views more  SIAMJO 2008»
13 years 11 months ago
On Bin Packing with Conflicts
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 . . ....
Leah Epstein, Asaf Levin
DAM
2008
88views more  DAM 2008»
13 years 11 months ago
On the asymmetric representatives formulation for the vertex coloring problem
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...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
ACTA
2008
136views more  ACTA 2008»
13 years 11 months ago
Two-dimensional packing with conflicts
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 ...
Leah Epstein, Asaf Levin, Rob van Stee
UAI
1990
14 years 18 days ago
separable and transitive graphoids
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...
Dan Geiger, David Heckerman
FCT
2007
Springer
14 years 3 months ago
Multi-dimensional Packing with Conflicts
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...
Leah Epstein, Asaf Levin, Rob van Stee