Unique sink orientations of grids

Lecture Notes in Computer Science

Volumn 3509, Issue , 2005, Pages 210-224

  Gärtner, Bernd ^a   Morris, Walter D ^b   Rüst, Leo ^a  

^a ETH ZURICH   (Switzerland)

^b GEORGE MASON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; RANDOM PROCESSES;

COMBINATORIAL STRUCTURES; DIGRAPH MODELS; GRIDS; SINK ORIENTATIONS;

GRAPH THEORY;

EID: 23944500027     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496915_16     Document Type: Conference Paper

References (36)

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)
2. Cottle, R.W., Dantzig, G.B.: A generalization of the linear complementarity problem. Journal on Combinatorial Theory 8 (1970) 79-90
3. Cottle, R.W., Pang, J., Stone, R.E.: The Linear Complementarity Problem. Academic Press (1992)
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)
5. Khachiyan, L.G.: Polynomial algorithms in linear programming. U.S.S.R. Comput. Math. and Math. Phys 20 (1980) 53-72
6. Adler, I., Saigal, R.: Long monotone paths in abstract polytopes. Math. Operations Research 1 (1976) 89-95
7. Kalai, G.: Linear programming, the simplex algorithm and simple polytopes. Math. Programming 79 (1997) 217-233
8. Wiedemann, D.: Unimodal set-functions. Congressus Numerantium 50 (1985) 165-169
9. Hoke, K.W.: Completely unimodal numberings of a simple polytope. Discrete Appl. Math. 20 (1988) 69-81
10. Kalai, G., Kleitman, D.J.: A quasi-polynomial bound for the diameter of graphs of polyhedra. Bulletin Amer. Math. Soc. 26 (1992) 315-316
11. Kalai, G.: A simple way to tell a simple polytope from its graph. J. Combinatorial Theory 49 (1988) 381-383
12. Björklund, H., Sandberg, S., Vorobyov, S.: Randomized subexponential algorithms for parity games. Technical Report TR-2003-019, Department of Information Technology (2003)
13. Björklund, H., Sandberg, S., Vorobyov, S.: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. In: Proc. 29th International Symposium on Mathematical Foundations of Computer Science (MFCS). Volume 3153 of Lecture Notes in Computer Science., Springer-Verlag (2004) 673-685
14. Grädel, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games. Volume 2500 of Lecture Notes in Computer Science. Springer-Verlag (2002)
15. Tschirschnitz, F.: LP-related Properties of Polytopes with Few Facets. PhD thesis, ETH Zürich (2003)
16. Felsner, S., Gärtner, B., Tschirschnitz, F.: Grid orientations, (d, d + 2)-polytopes, and arrangements of pseudolines. Discrete and Computational Geometry (to appear)
17. Stickney, A., Watson, L.: Digraph models of Bard-type algorithms for the linear complementarity problem. Mathematics of Operations Research 3 (1978) 322-333
18. nd IEEE Symp. on Foundations of Comput. Sci. (2000) 547-555
19. Kleinschmidt, P., Onn, S.: Signable posets and partitionable simplicial complexes. Discrete Comput. Geom. 15 (1996) 443-466
20. Matoušek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16 (1996) 498-516
21. Chazelle, B., Matoušek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21 (1996) 579-597
22. Clarkson, K.L.: Las Vegas algorithms for linear and integer programming. J. ACM 42 (1995) 488-499
23. Gärtner, B., Welzl, E.: Linear programming - randomization and abstract frameworks. In: Proc. 13th Ann. ACM Symp. Theoretical Aspects of Computer Science. Volume 1046 of Lecture Notes Comput. Sci., Springer-Verlag (1996) 669-687
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)
25. Matoušek, J.: Lower bounds for a subexponential optimization algorithm. Random Structures & Algorithms 5 (1994) 591-607
26. Gärtner, B.: The Random-Facet simplex algorithm on combinatorial cubes. Random Structures & Algorithms 20 (2002)
27. Schäfer, U.: A linear complementarity problem with a P-matrix. SIAM Review 46 (2004) 189-201
28. Chvátal, V.: Linear Programming. W. H. Freeman, New York, NY (1983)
29. Szanc, B.P.: The Generalized Complementarity Problem. PhD thesis, Rensselaer Polytechnic Institute, Troy, NY (1989)
30. Gowda, M.S., Sznajder, R.: The generalized order linear complementarity problem. SIAM J. Matrix Anal. Appl. 15 (1994) 779-795
31. Sloane, N.J.A.: Sequence A000522. The On-Line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences/ (2004)
32. Seidel, R.: Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6 (1991) 423-434
33. Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In Maurer, H., ed.: New Results and New Trends in Computer Science. Volume 555 of Lecture Notes Comput. Sci. Springer-Verlag (1991) 359-370
34. Ziegler, G. M.: Lectures on Polytopes. Springer-Verlag (1995)
35. Gordan, P.: Über die Auflösung linearer Gleichungen mit reellen Coefficienten. Mathematische Annalen 6 (1873) 23-28
36. Stiemke, E.: Über positive Lösungen homogener linearer Gleichungen. Journal für die reine und angewandte Mathematik 76 (1915) 340-342