Skip to main content
SpringerLink
Log in

Unique Sink Orientations of Grids

  • Conference paper
Integer Programming and Combinatorial Optimization (IPCO 2005)

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

Abstract

We introduce unique sink orientations of grids as digraph models for many well-studied problems, including linear programming over products of simplices and generalized linear complementarity problems over P-matrices (PGLCP). We investigate the combinatorial structure of such orientations and develop randomized algorithms for finding the sink. We show that the orientations arising from PGLCP satisfy the combinatorial Holt-Klee condition known to hold for polytope digraphs, and we give the first expected linear-time algorithms for solving PGLCP with a fixed number of blocks.

The first and the third author acknowledge support from the Swiss Science Foundation (SNF), Project No. 200021-100316/1. Part of this research was done at the 2004 Barbados Undercurrent Workshop Polyhedra, Convex Geometry, and Optimization at Bellairs Research Institute, McGill University. For a full paper see [1].

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. Gärtner, B., Morris Jr., W.D., Rüst, L.: Unique sink orientations of grids. Technical Report 472, Institute of Theoretical Computer Science (2005)

    Google Scholar 

  2. Cottle, R.W., Dantzig, G.B.: A generalization of the linear complementarity problem. Journal on Combinatorial Theory 8, 79–90 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cottle, R.W., Pang, J., Stone, R.E.: The Linear Complementarity Problem. Academic Press, London (1992)

    MATH  Google Scholar 

  4. Megiddo, N.: A note on the complexity of P-matrix LCP and computing an equilibrium. Technical report, IBM Almaden Research Center, San Jose (1988)

    Google Scholar 

  5. Khachiyan, L.G.: Polynomial algorithms in linear programming. U.S.S.R. Comput. Math. and Math. Phys. 20, 53–72 (1980)

    Article  MATH  Google Scholar 

  6. Adler, I., Saigal, R.: Long monotone paths in abstract polytopes. Math. Operations Research 1, 89–95 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kalai, G.: Linear programming, the simplex algorithm and simple polytopes. Math. Programming 79, 217–233 (1997)

    MathSciNet  MATH  Google Scholar 

  8. Wiedemann, D.: Unimodal set-functions. Congressus Numerantium 50, 165–169 (1985)

    MathSciNet  Google Scholar 

  9. Hoke, K.W.: Completely unimodal numberings of a simple polytope. Discrete Appl. Math. 20, 69–81 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kalai, G., Kleitman, D.J.: A quasi-polynomial bound for the diameter of graphs of polyhedra. Bulletin Amer. Math. Soc. 26, 315–316 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kalai, G.: A simple way to tell a simple polytope from its graph. J. Combinatorial Theory 49, 381–383 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  12. Björklund, H., Sandberg, S., Vorobyov, S.: Randomized subexponential algorithms for parity games. Technical Report TR-2003-019, Department of Information Technology (2003)

    Google Scholar 

  13. Björklund, H., Sandberg, S., Vorobyov, S.: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 673–685. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Grädel, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  15. Tschirschnitz, F.: LP-related Properties of Polytopes with Few Facets. PhD thesis, ETH Zürich (2003)

    Google Scholar 

  16. Felsner, S., Gärtner, B., Tschirschnitz, F.: Grid orientations (d,d + 2)-polytopes, and arrangements of pseudolines. Discrete and Computational Geometry (to appear)

    Google Scholar 

  17. Stickney, A., Watson, L.: Digraph models of Bard-type algorithms for the linear complementarity problem. Mathematics of Operations Research 3, 322–333 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  18. Szabó, T., Welzl, E.: Unique sink orientations of cubes. In: Proc. 42nd IEEE Symp. on Foundations of Comput. Sci., pp. 547–555 (2000)

    Google Scholar 

  19. Kleinschmidt, P., Onn, S.: Signable posets and partitionable simplicial complexes. Discrete Comput. Geom. 15, 443–466 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  20. Matoušek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16, 498–516 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  21. Chazelle, B., Matoušek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21, 579–597 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  22. Clarkson, K.L.: Las Vegas algorithms for linear and integer programming. J. ACM 42, 488–499 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  23. Gärtner, B., Welzl, E.: Linear programming – randomization and abstract frameworks. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 669–687. Springer, Heidelberg (1996)

    Google Scholar 

  24. Holt, F., Klee, V.: A proof of the strict monotone 4-step conjecture. In: Chazelle, J., Goodman, J.B., Pollack, R. (eds.) Advances in Discrete and Computational geometry. Contemporary Mathematics. Amer. Math. Soc. (1998)

    Google Scholar 

  25. Matoušek, J.: Lower bounds for a subexponential optimization algorithm. Random Structures & Algorithms 5, 591–607 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  26. Gärtner, B.: The Random-Facet simplex algorithm on combinatorial cubes. Random Structures & Algorithms 20 (2002)

    Google Scholar 

  27. Schäfer, U.: A linear complementarity problem with a P-matrix. SIAM Review 46, 189–201 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  28. Chvátal, V.: Linear Programming. W. H. Freeman, New York (1983)

    MATH  Google Scholar 

  29. Szanc, B.P.: The Generalized Complementarity Problem. PhD thesis, Rensselaer Polytechnic Institute, Troy, NY (1989)

    Google Scholar 

  30. Gowda, M.S., Sznajder, R.: The generalized order linear complementarity problem. SIAM J. Matrix Anal. Appl. 15, 779–795 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  31. Sloane, N.J.A.: Sequence A000522. The On-Line Encyclopedia of Integer Sequences (2004) http://www.research.att.com/~njas/sequences/

  32. Seidel, R.: Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6, 423–434 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  33. Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H.A. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  34. Ziegler, G.M.: Lectures on Polytopes. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  35. Gordan, P.: Über die Auflösung linearer Gleichungen mit reellen Coefficienten. Mathematische Annalen 6, 23–28 (1873)

    Article  MathSciNet  Google Scholar 

  36. Stiemke, E.: Über positive Lösungen homogener linearer Gleichungen. Journal für die reine und angewandte Mathematik 76, 340–342 (1915)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zürich, CH-8092, Zürich, Switzerland

    Bernd Gärtner & Leo Rüst

  2. Department of Mathematical Sciences, George Mason University, MS 3F2, US-Fairfax, VA, 22030-4444, USA

    Walter D. Morris

Authors
  1. Bernd Gärtner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter D. Morris
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leo Rüst
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität zu Köln,  

    Michael Jünger

  2. Fakultät für Mathematik, Otto-von-Guericke Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Volker Kaibel

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gärtner, B., Morris, W.D., Rüst, L. (2005). Unique Sink Orientations of Grids. In: Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2005. Lecture Notes in Computer Science, vol 3509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496915_16

Download citation

  • DOI: https://doi.org/10.1007/11496915_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26199-5

  • Online ISBN: 978-3-540-32102-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation