284 search results - page 14 / 57 » On Some Polyhedra Covering Problems |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
JUCS
2006
13 years 8 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
CONCUR
2007
Springer
14 years 23 days ago
2007
Springer
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
COMPGEOM
1999
ACM
14 years 1 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
DISOPT
2008
13 years 9 months ago
2008
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...