@inproceedings{Abed2015Guill-33469,
  year={2015},
  doi={10.4230/LIPIcs.APPROX-RANDOM.2015.1},
  title={On Guillotine Cutting Sequences},
  number={40},
  isbn={978-3-939897-89-7},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  address={Wadern},
  series={LIPIcs-Leibniz International Proceedings in Informatics},
  booktitle={Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
  pages={1--19},
  editor={Garg, Naveen},
  author={Abed, Fidaa and Chalermsook, Parinya and Correa, José and Karrenbauer, Andreas and Pérez-Lantero, Pablo and Soto, José A. and Wiese, Andreas}
}

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/33469">
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/33469/1/Abed_0-318529.pdf"/>
    <dc:language>eng</dc:language>
    <dc:creator>Chalermsook, Parinya</dc:creator>
    <dc:creator>Pérez-Lantero, Pablo</dc:creator>
    <dc:contributor>Karrenbauer, Andreas</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Soto, José A.</dc:contributor>
    <dcterms:abstract xml:lang="eng">Imagine a wooden plate with a set of non-overlapping geometric objects painted on it. How many of them can a carpenter cut out using a panel saw making guillotine cuts, i.e., only moving forward through the material along a straight line until it is split into two pieces? Already fifteen years ago, Pach and Tardos investigated whether one can always cut out a constant fraction if all objects are axis-parallel rectangles. However, even for the case of axis-parallel squares this question is still open. In this paper, we answer the latter affirmatively. Our result is constructive and holds even in a more general setting where the squares have weights and the goal is to save as much weight as possible. We further show that when solving the more general question for rectangles affirmatively with only axis-parallel cuts, this would yield a combinatorial O(1)-approximation algorithm for the Maximum Independent Set of Rectangles problem, and would thus solve a long-standing open problem. In practical applications, like the mentioned carpentry and many other settings, we can usually place the items freely that we want to cut out, which gives rise to the two-dimensional guillotine knapsack problem: Given a collection of axis-parallel rectangles without presumed coordinates, our goal is to place as many of them as possible in a square-shaped knapsack respecting the constraint that the placed objects can be separated by a sequence of guillotine cuts. Our main result for this problem is a quasi-PTAS, assuming the input data to be quasi-polynomially bounded integers. This factor matches the best known (quasi-polynomial time) result for (non-guillotine) two-dimensional knapsack.</dcterms:abstract>
    <dc:contributor>Wiese, Andreas</dc:contributor>
    <dc:contributor>Abed, Fidaa</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-03-24T12:35:31Z</dc:date>
    <dc:contributor>Pérez-Lantero, Pablo</dc:contributor>
    <dc:creator>Correa, José</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/33469/1/Abed_0-318529.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Correa, José</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/33469"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Wiese, Andreas</dc:creator>
    <dc:contributor>Chalermsook, Parinya</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-03-24T12:35:31Z</dcterms:available>
    <dc:creator>Soto, José A.</dc:creator>
    <dc:creator>Karrenbauer, Andreas</dc:creator>
    <dcterms:issued>2015</dcterms:issued>
    <dcterms:title>On Guillotine Cutting Sequences</dcterms:title>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Abed, Fidaa</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
  </rdf:Description>
</rdf:RDF>