Skip to main content
SpringerLink
Log in

Multiline Addressing by Network Flow

  • Conference paper
Algorithms – ESA 2006 (ESA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4168))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Xu, C., Wahl, J., Eisenbrand, F., Karrenbauer, A., Soh, K.M., Hitzelberger, C.: Verfahren zur Ansteuerung von Matrixanzeigen. Patent 10 2005 063 159 Germany (pending, 2005)

    Google Scholar 

  2. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2 (1988)

    Google Scholar 

  3. Khachiyan, L.: A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR 244, 1093–1097 (1979)

    MATH  MathSciNet  Google Scholar 

  4. Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Operations Res. Soc. Amer. 2, 393–410 (1954)

    MathSciNet  Google Scholar 

  5. Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: FOCS, pp. 300–309 (1998)

    Google Scholar 

  6. Murano, S., Burghart, M., Birnstock, J., Wellmann, P., Vehse, M., Werner, A., Canzler, T., Stübinger, T., He, G., Pfeiffer, M., Boerner, H.: Highly efficient white OLEDs for lighting applications. In: SPIE 2005, San Diego (2005)

    Google Scholar 

  7. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. Theory, algorithms, and applications. Prentice Hall Inc., Englewood Cliffs (1993)

    Google Scholar 

  8. Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency, vol. 24. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  9. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Dortmund,  

    Friedrich Eisenbrand

  2. Max-Planck-Institut für Informatik, Saarbrücken

    Andreas Karrenbauer

  3. Fachbereich Mathematik, Universität Dortmund,  

    Martin Skutella

  4. Lehrstuhl für Mikroelektronik, Universität Saarbrücken,  

    Chihao Xu

Authors
  1. Friedrich Eisenbrand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Karrenbauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Skutella
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chihao Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA and School of Computer Science, Tel-Aviv University, 69978, Tel-Aviv, Israel

    Yossi Azar

  2. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Thomas Erlebach

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eisenbrand, F., Karrenbauer, A., Skutella, M., Xu, C. (2006). Multiline Addressing by Network Flow. In: Azar, Y., Erlebach, T. (eds) Algorithms – ESA 2006. ESA 2006. Lecture Notes in Computer Science, vol 4168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841036_66

Download citation

  • DOI: https://doi.org/10.1007/11841036_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38875-3

  • Online ISBN: 978-3-540-38876-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation