Search Sciweavers | Sciweavers

19

COMBINATORICS
2006

147views more COMBINATORICS 2006»

A Survey on Packing and Covering Problems in the Hamming Permutation Space

13 years 7 months ago

Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH ) are surveyed, including a combination of b...

Jörn Quistorff

claim paper

Read More »

23

click to vote

JGT
2006

114views more JGT 2006»

The chromatic covering number of a graph

13 years 7 months ago

Download www.math.carleton.ca

Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...

Reza Naserasr, Claude Tardif

claim paper

Read More »

24

click to vote

SIAMCOMP
2008

108views more SIAMCOMP 2008»

A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover

13 years 7 months ago

Download www.disp.uniroma2.it

In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...

Fabrizio Grandoni, Jochen Könemann, Alessandr...

claim paper

Read More »

22

click to vote

JAIR
2007

141views more JAIR 2007»

Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems

13 years 7 months ago

Download www.aaai.org

Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...

Alex S. Fukunaga, Richard E. Korf

claim paper

Read More »

23

click to vote

CORR
2002
Springer

102views Education» more CORR 2002»

Tight Approximation Results for General Covering Integer Programs

13 years 7 months ago