Approximation Algorithms in the Successive Hitting Set Model

Lade...
Vorschaubild
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2015
Autor:innen
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
ELBASSIONI, Khaled, ed., Kazuhisa MAKINO, ed.. Algorithms and Computation : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, proceedings. Heidelberg: Springer, 2015, pp. 453-464. Lecture Notes in Computer Science. 9472. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-662-48970-3. Available under: doi: 10.1007/978-3-662-48971-0_39
Zusammenfassung

We introduce the successive Hitting Set model, where the set system is not given in advance but a set generator produces the sets that contain a specific element from the universe on demand. Despite incomplete knowledge about the set system, we show that several approximation algorithms for the conventional Hitting Set problem can be adopted to perform well in this model. We describe, and experimentally investigate, several scenarios where the new model is beneficial compared to the conventional one.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
26th International Symposium, ISAAC 2015, 9. Dez. 2015 - 11. Dez. 2015, Nagoya, Japan
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690STORANDT, Sabine, 2015. Approximation Algorithms in the Successive Hitting Set Model. 26th International Symposium, ISAAC 2015. Nagoya, Japan, 9. Dez. 2015 - 11. Dez. 2015. In: ELBASSIONI, Khaled, ed., Kazuhisa MAKINO, ed.. Algorithms and Computation : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, proceedings. Heidelberg: Springer, 2015, pp. 453-464. Lecture Notes in Computer Science. 9472. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-662-48970-3. Available under: doi: 10.1007/978-3-662-48971-0_39
BibTex
@inproceedings{Storandt2015-11-27Appro-43547,
  year={2015},
  doi={10.1007/978-3-662-48971-0_39},
  title={Approximation Algorithms in the Successive Hitting Set Model},
  number={9472},
  isbn={978-3-662-48970-3},
  issn={0302-9743},
  publisher={Springer},
  address={Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Algorithms and Computation : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, proceedings},
  pages={453--464},
  editor={Elbassioni, Khaled and Makino, Kazuhisa},
  author={Storandt, Sabine}
}
RDF
<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/43547">
    <dc:contributor>Storandt, Sabine</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/43547"/>
    <dcterms:issued>2015-11-27</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-16T12:06:29Z</dc:date>
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-16T12:06:29Z</dcterms:available>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>Approximation Algorithms in the Successive Hitting Set Model</dcterms:title>
    <dcterms:abstract xml:lang="eng">We introduce the successive Hitting Set model, where the set system is not given in advance but a set generator produces the sets that contain a specific element from the universe on demand. Despite incomplete knowledge about the set system, we show that several approximation algorithms for the conventional Hitting Set problem can be adopted to perform well in this model. We describe, and experimentally investigate, several scenarios where the new model is beneficial compared to the conventional one.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Storandt, Sabine</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen