270 search results - page 28 / 54 » Partitioning into Sets of Bounded Cardinality |
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
— We extend techniques for a reachability-based ion to continuous systems under shared control, that is, systems which have both inputs controlled by the automation and inputs co...
COMBINATORICS
2000
13 years 8 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
ICALP
2000
Springer
14 years 11 days ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...