Sciweavers

270 search results - page 12 / 54
» Partitioning into Sets of Bounded Cardinality
Sort
View
SAC
2009
ACM
15 years 6 months ago
Length-lex bound consistency for knapsack constraints
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
Justin Yip, Pascal Van Hentenryck
CP
2008
Springer
15 years 1 months ago
Length-Lex Bounds Consistency for Knapsack Constraints
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
Yuri Malitsky, Meinolf Sellmann, Willem Jan van Ho...
COLT
2007
Springer
15 years 5 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
JCO
2007
97views more  JCO 2007»
14 years 11 months ago
Restricted domination parameters in graphs
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
Wayne Goddard, Michael A. Henning
GC
2007
Springer
14 years 11 months ago
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...