Sciweavers

287 search results - page 12 / 58
» Exact Cover with light
Sort
View
WG
2007
Springer
15 years 6 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
DM
2010
124views more  DM 2010»
14 years 12 months ago
Asymptotic enumeration of 2-covers and line graphs
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
Peter J. Cameron, Thomas Prellberg, Dudley Stark
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
14 years 11 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
CF
2008
ACM
15 years 1 months ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman
IPCO
2010
160views Optimization» more  IPCO 2010»
15 years 1 months ago
On Column-Restricted and Priority Covering Integer Programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...