Minimax Problems with Bitonic Matrices

Networks

Volumn 40, Issue 3, 2002, Pages 113-124

  Hochbaum, Dorit S ^a   Tucker, Paul A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bitonic property; Circular 1's; Consecutive 1's constraints; Minimax; Minimum cost network flow; PQ tree; Set cover; Shortest paths

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

MINIMAX PROBLEMS;

MATRIX ALGEBRA;

EID: 0141429891     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10038     Document Type: Review

References (15)

1. J.J. Bartholdi, J.B. Orlin, and H.D. Ratliff, Cyclic scheduling via integer programs with circular ones, Oper Res 28 (1980), 1074-1085.
2. K.S. Booth. PQ-tree algorithms, Ph.D. Thesis, University of California (Available as UCRL 51953, Lawrence Livermore Labs, Livermore CA), 1975.
3. K.S. Booth and G.S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ trees, J Comput Syst Sci 13 (1976), 335-379.
4. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, 1990.
5. D.R. Fulkerson and O.A. Gross, Incidence matrices and interval graphs, Pac J Math 15 (1965), 835-855.
6. M.C. Golumbic, Interval graphs and related topics, Discr Math 55 (1985), 113-121.
7. J.B. Goodenough and S.L. Gerhart, "Toward a theory of testing: data selection criteria," Current trends in programming methodology, R.T. Yen (Editor), Prentice-Hall, Englewood Cliffs, NJ, 1977, Vol. 2, pp. 44-79.
8. Y. Huang, Software dependability measurement during testing, PhD Thesis, University of California, San Diego, La Jolla, CA, 1994.
9. J.M. Keil, Finding Hamiltonian circuits in interval graphs, Info Process Lett 20 (1985), 201-206.
10. M.V. Marathe, R. Ravi, and C.P. Rangan, Generalized vertex covering in interval graphs, Discr Appl Math 39 (1992), 87-93.
11. J.D. Musa, Software reliability engineering, McGraw-Hill, New York, 1998.
12. D.J. Rose, R.E. Tarjan, and G.S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J Comput 5 (1976), 266-283.
13. A.C. Tucker, A structure theorem for the consecutive 1's property, J Combin Theory B 12 (1972), 153-162.
14. A.F. Veinott and H.M. Wagner, Optimal capacity scheduling: Parts I and II, Oper Res 10 (1962), 518-547.
15. H. Zhu, P.A. Hall, and J.H. May, Software unit test coverage and adequacy, ACM Comput Surv 29 (1997), 336-427.