Efficient algorithms for the inverse spanning-tree problem

Operations Research

Volumn 51, Issue 5, 2003, Pages

  Hochbaum, Dorit S ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

Mathematics: convexity, convex optimization problem; Network graphs: flow algorithms, parametric minimum cut; Programming: integer, algorithms, optimization in integers

Indexed keywords

CONVEX OPTIMIZATION PROBLEM; CONVEXITY; COST PARAMETERS; FLOW ALGORITHMS; INVERSE SPANNING-TREE PROBLEM (IST); OPTIMIZATION IN INTEGERS; PARAMETRIC MINIMUM CUT;

ALGORITHMS; COSTS; GRAPH THEORY; INTEGER PROGRAMMING; OPTIMIZATION; TREES (MATHEMATICS);

PROBLEM SOLVING;

EID: 3142618986     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.5.785.16756     Document Type: Article

References (18)

1. Ahuja, R. K., J. B. Orlin. 2000. A faster algorithm for the inverse spanning tree problem. J. Algorithms 34 177-193.
2. _, D. S. Hochbaum, J. B. Orlin. 1999a. Solving the convex cost integer dual network flow problem. G. Cornuejols, R. E. Burkard, G. J. Woeginger, eds. Proc. IPCO'99. Lecture Notes in Computer Science, Vol. 1610, 31-44. Management Sci. Forthcoming.
3. _, _, _. 1999b. A cut based algorithm for the convex dual of the minimum cost network flow problem. Manuscript, University of California, Berkeley, CA.
4. _, J. B. Orlin, C. Stein, R. E. Tarjan. 1994. Improved algorithms for bipartite network flow. SIAM J. Comput. 23 906-933.
5. Barlow, R. E., D. J. Bartholomew, J. M. Bremer, H. D. Brunk. 1972. Statistical Inference Under Order Restrictions. Wiley, New York.
6. Dinic, E. A. 1970. Algorithm for solution of a problem of maximal flow in a network with power estimation. Soviet Math. Dokl. 11 1277-1280.
7. Even, S., R. E. Tarjan. 1975. Network flow and testing graph connectivity. SIAM J. Comput. 4 507-518.
8. Gallo, G., M. D. Grigoriadis, R. E. Tarjan. 1989. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18 30-55.
9. Goldberg, A. V., R. E. Tarjan. 1988. A new approach to the maximum flow problem. J. ACM 35 921-940.
10. Gusfield, D., C. Martel, D. Fernandez-Baca. 1987. Fast algorithms for bipartite network flow. SIAM J. Comput. 16 237-251.
11. Hochbaum, D. S. 1994. Lower and upper bounds for allocation problems. Math. Oper. Res. 19 390-409.
12. _. 1997. The pseudoflow algorithm for the maximum flow problem. Manuscript, University of California, Berkeley, CA.
13. _, M. Queyranne. 2003. The convex cost closure problem. SIAM J. Discrete Math. 16 192-207.
14. _, J. G. Shanthikumar. 1990. Convex separable optimization is not much harder than linear optimization. J. ACM 37 843-862.
15. Picard, J. C. 1976. Maximal closure of a graph and applications to combinatorial problems. Management Sci. 22 1268-1272.
16. Sleator, D. D., R. E. Tarjan. 1983. A data structure for dynamic trees. J. Comput. Systems Sci. 24 362-391.
17. Sokkalingam, P. T., R. Ahuja, J. B. Orlin. 1999. Solving inverse spanning tree problems through network flow techniques. Oper. Res. 47 291-298.
18. Tarantola, A. 1987. Inverse Problem Theory: Methods for Data Fitting and Model Parameter Estimation. Elsevier, Amsterdam, The Netherlands.