Publikation:

Multiline Addressing by Network Flow

Lade...
Vorschaubild

Dateien

Multiline_Addressing_by_Network_Flow.pdf
Multiline_Addressing_by_Network_Flow.pdfGröße: 946.8 KBDownloads: 725

Datum

2009

Autor:innen

Eisenbrand, Friedrich
Skutella, Martin
Xu, Chihao

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Algorithmica. 2009, 53(4), pp. 583-596. Available under: doi: 10.1007/s00453-008-9252-5

Zusammenfassung

We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes which has a direct impact on the lifetime of such a display. Modeling the problem in mathematical terms yields a class of network flow problems where we group the arcs and pay in each group only for the arc carrying the maximum flow. We develop (fully) combinatorial approximation heuristics suitable for being implemented in the hardware of a control device that drives an OLED display.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Combinatorial optimization, Network design, OLED, Algorithm engineering, Matrix decomposition

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690EISENBRAND, Friedrich, Andreas KARRENBAUER, Martin SKUTELLA, Chihao XU, 2009. Multiline Addressing by Network Flow. In: Algorithmica. 2009, 53(4), pp. 583-596. Available under: doi: 10.1007/s00453-008-9252-5
BibTex
@article{Eisenbrand2009Multi-6103,
  year={2009},
  doi={10.1007/s00453-008-9252-5},
  title={Multiline Addressing by Network Flow},
  number={4},
  volume={53},
  journal={Algorithmica},
  pages={583--596},
  author={Eisenbrand, Friedrich and Karrenbauer, Andreas and Skutella, Martin and Xu, Chihao}
}
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/6103">
    <dcterms:title>Multiline Addressing by Network Flow</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Karrenbauer, Andreas</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes which has a direct impact on the lifetime of such a display. Modeling the problem in mathematical terms yields a class of network flow problems where we group the arcs and pay in each group only for the arc carrying the maximum flow. We develop (fully) combinatorial approximation heuristics suitable for being implemented in the hardware of a control device that drives an OLED display.</dcterms:abstract>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:34Z</dc:date>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6103/1/Multiline_Addressing_by_Network_Flow.pdf"/>
    <dc:format>application/pdf</dc:format>
    <dc:contributor>Eisenbrand, Friedrich</dc:contributor>
    <dc:contributor>Xu, Chihao</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6103"/>
    <dc:contributor>Skutella, Martin</dc:contributor>
    <dc:creator>Eisenbrand, Friedrich</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6103/1/Multiline_Addressing_by_Network_Flow.pdf"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dcterms:bibliographicCitation>Publ. in: Algorithmica ; 53 (2009), 4. - S. 583-596</dcterms:bibliographicCitation>
    <dc:language>eng</dc:language>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:34Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Karrenbauer, Andreas</dc:creator>
    <dcterms:issued>2009</dcterms:issued>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dc:creator>Xu, Chihao</dc:creator>
    <dc:creator>Skutella, Martin</dc:creator>
  </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