16404 search results - page 682 / 3281 » A set coverage problem |
206
click to vote
IPCO
2010
15 years 8 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
189
click to vote
CCCG
2001
15 years 8 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
223
click to vote
KIC
2000
15 years 8 months ago
2000
Abstract: This paper presents some results of our research on design simplification by analogical reasoning. It first defines what we mean by a simplification problem. Then it desc...
202
click to vote
EJC
2010
15 years 7 months ago
2010
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
181
click to vote
CC
2006
Springer
15 years 7 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...