A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem

Lade...
Vorschaubild
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2016
Autor:innen
Becker, Ruben
Fickert, Maximilian
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
GOODRICH, Michael, ed., Michael MITZENMACHER, ed.. 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Philadelphia: Siam, 2016, pp. 151-159. ISBN 978-1-61197-431-7. Available under: doi: 10.1137/1.9781611974317.13
Zusammenfassung

We present a novel algorithm for the min-cost flow problem that is competitive with recent third-party implementations of well-known algorithms for this problem and even outperforms them on certain realistic instances. We formally prove correctness of our algorithm and show that the worst-case running time is in O(‖b‖1(m + n log n)) where b is the vector of demands. Combined with standard scaling techniques, this pseudo-polynomial bound can be made polynomial in a straightforward way. Furthermore, we evaluate our approach experimentally. Our empirical findings indeed suggest that the running time does not significantly depend on the costs and that a linear dependence on ‖b‖1 is overly pessimistic.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
ALENEX16 : Meeting on Algorithm Engineering & Experiments, 10. Jan. 2016 - 10. Jan. 2016, Arlington, Virginia, USA
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690BECKER, Ruben, Maximilian FICKERT, Andreas KARRENBAUER, 2016. A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. ALENEX16 : Meeting on Algorithm Engineering & Experiments. Arlington, Virginia, USA, 10. Jan. 2016 - 10. Jan. 2016. In: GOODRICH, Michael, ed., Michael MITZENMACHER, ed.. 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Philadelphia: Siam, 2016, pp. 151-159. ISBN 978-1-61197-431-7. Available under: doi: 10.1137/1.9781611974317.13
BibTex
@inproceedings{Becker2016Novel-34517,
  year={2016},
  doi={10.1137/1.9781611974317.13},
  title={A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem},
  isbn={978-1-61197-431-7},
  publisher={Siam},
  address={Philadelphia},
  booktitle={2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)},
  pages={151--159},
  editor={Goodrich, Michael and Mitzenmacher, Michael},
  author={Becker, Ruben and Fickert, Maximilian and Karrenbauer, Andreas}
}
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/34517">
    <dc:contributor>Fickert, Maximilian</dc:contributor>
    <dc:contributor>Karrenbauer, Andreas</dc:contributor>
    <dc:creator>Becker, Ruben</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/34517"/>
    <dc:creator>Karrenbauer, Andreas</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-06-24T06:55:38Z</dc:date>
    <dcterms:issued>2016</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-06-24T06:55:38Z</dcterms:available>
    <dc:creator>Fickert, Maximilian</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dc:contributor>Becker, Ruben</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:language>eng</dc:language>
    <dcterms:abstract xml:lang="eng">We present a novel algorithm for the min-cost flow problem that is competitive with recent third-party implementations of well-known algorithms for this problem and even outperforms them on certain realistic instances. We formally prove correctness of our algorithm and show that the worst-case running time is in O(‖b‖1(m + n log n)) where b is the vector of demands. Combined with standard scaling techniques, this pseudo-polynomial bound can be made polynomial in a straightforward way. Furthermore, we evaluate our approach experimentally. Our empirical findings indeed suggest that the running time does not significantly depend on the costs and that a linear dependence on ‖b‖1 is overly pessimistic.</dcterms:abstract>
    <dcterms:title>A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem</dcterms:title>
  </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