Skip to main content

Visualizing, Finding and Packing Dijoins

  • Chapter

Abstract

We consider the probleni of making a directed graph strongly connected. To achieve this, we are allowed for assorted costs to add the reverse of any arc. A successful set of arcs, called a dijoin, must intersect every directed cut. Lucchesi and Younger gave a min-max theorem for the problem of finding a mininmum cost dijoin. Less understood is the extent to which dijoins pack. One difliculty is that dijoins are not as easily visualized as other combinatorial objects such as matchings, trees or flows. We give two results which act as visual certificates for dijoins. One of these, called a lobe decomposition, resembles Whitney's ear decomposition for 2-connected graphs. The decomposition leads to a natural optimality condition for dijoins. Based on this, we give a simple description of Frank's primal-dual algorithm to find a minimum dijoin. Our implementation is purely primal and only uses greedy tree growing procedures. Its runtime is O(n 2 m), matching the best known, due to Gabow. We then consider the function f(k) which is the maximurn value such that every weighted directed graph whose minimum weight of a directed cut is at least k, admits a weighted packing of f(k) dijoins (a weighted packing means that the number dijoins containing an arc is at most its weight). We ask whether f(k) approaches infinity. It is not yet known whether f(k 0) ≥ 2 for sorne constant k 0. We consider a concept of skew submodular flow polyhedra and show that this dijoin- pair question reduces to finding conditions on when their integer hulls are non-empty. We also show that for any k, there exists a half-integral dijoin packing of size k/2.

Keywords

  • Complete Cycle
  • Directed Cycle
  • Submodular Function
  • Negative Cycle
  • Negative Cost

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/0-387-25592-3_8
  • Chapter length: 36 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   109.00
Price excludes VAT (USA)
  • ISBN: 978-0-387-25592-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   139.00
Price excludes VAT (USA)
Hardcover Book
USD   139.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bhandari, R. (1994). Optimal diverse routing in telecommunication fiber networks. Proceedings of IEEE Infocom, pp. 1498–1508.

    Google Scholar 

  • Chvátal, V. (1975). On certain polytopes associated with graphs. Journal of Combinatorial Theory, Series B, 18:138–154.

    MATH  MathSciNet  CrossRef  Google Scholar 

  • Cook, W., Cunningham, W., Pulleyblank, W., and Schrijver, A. (1998). Combinatorial Optimization. Wiley-Interscience, New York.

    Google Scholar 

  • Cui, W. and Fujishige, S. (1998). A primal algorithm for the submodular flow problem with minimum-mean cycle selection. Journal of the Operations Research Society of Japan, 31:431–440.

    MathSciNet  Google Scholar 

  • Cunningham, W. and Frank, A. (1985). A primal-dual algorithm for submodular flows. Mathematics of Operations Research, 10(2):251–261.

    MathSciNet  Google Scholar 

  • Edmonds, J. (1973). Edge-disjoint branchings. In: R. Rustin (ed.), Combinatorial Algorithms, pp. 91–86, Alg. Press, New York.

    Google Scholar 

  • Edmonds, J. and Giles, R. (1977). A min-max relation for submodular functions on graphs. Annals of Discrete Mathematics, 1:185–204.

    MathSciNet  CrossRef  Google Scholar 

  • Frank, A. (1981). How to make a, digraph strongly connected. Combinatorica, 1:145–153.

    MATH  MathSciNet  Google Scholar 

  • Frank, A., Király, T., and Király, Z. (2001). On the Orientation of Graphs and Hypergraphs. Technical Report TR-2001-06 of the Egerváry Research Group, Budapest, Hungary.

    Google Scholar 

  • Feofiloff, P. and Younger, D. (1987). Directed cut transversal packing for source-sink connected graphs. Combinatorica, 7:255–263.

    MathSciNet  Google Scholar 

  • Fleischer, L. and Iwata, S. (2000). Improved algorithms for submodular function minimization and submodular flow. STOC, 107–116.

    Google Scholar 

  • Fujishige, S. (1978). Algorithms for solving the independent flow problem. Journal of the Operations Research Society of Japan, 21(2):189–204.

    MATH  MathSciNet  Google Scholar 

  • Fujishige, S. (1991). Submodular functions and optimization. Annals of Discrete Mathematics, 47, Monograph, North Holland Press, Amsterdam.

    Google Scholar 

  • Gabow, H. (1995). Centroids, representations, and submodular flows. Journal of Algorithms, 18:586–628.

    MATH  MathSciNet  CrossRef  Google Scholar 

  • Iwata, S., Fleischer, L., and Fujishige, S. (2001). A combinatorial strongly polynomial time algorithm for minimizing submodular functions. Journal of the ACM, 48(4):761–777.

    MathSciNet  CrossRef  Google Scholar 

  • Iwata, S., McCormick, S., and Shigeno, M. (2003). Fast cycle canceling algorithms for minimum cost submodular flow. Combinatorica, 23:503–525.

    MathSciNet  CrossRef  Google Scholar 

  • Jain, K. (2001). A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica, 21(1):39–60.

    MathSciNet  CrossRef  Google Scholar 

  • Karzanov, A.V. (1979). On the minimal number of arcs of a digraph meeting all its directed cutsets. Abstract in Graph Theory Newsletter, 8.

    Google Scholar 

  • Khanna, S., Naor, S., and Shepherd, F.B. (1999). Directed network design problems with orientation constraints. SODA, 663–671.

    Google Scholar 

  • Klein, M. (1967). A primal method for minimal cost flows. Management Science, 14:205–220.

    MATH  CrossRef  Google Scholar 

  • Lee O. and Wakabayashi, Y. (2001). Note on a min-max conjecture of Woodall. Journal of Graph Theory, 14:36–41.

    CAS  MathSciNet  CrossRef  Google Scholar 

  • Lehman, A. (1990). Width-length inequality and degenerate projective planes. In: P.D. Seymour and W. Cook (eds.), Polyhedral Combinatorics, pp. 101–106, Proceedings of the DIMACS Workshop, Morristown, New Jersey, June 1989. American Mathematical Society.

    Google Scholar 

  • Lovász, L. (1976). On two minmax theorems in graphs. Journal of Combinatorial Theory, Series B, 21:96–103.

    MATH  MathSciNet  CrossRef  Google Scholar 

  • Lucchesi, C. (1976). A Minimax Equality for Directed Graphs. Ph.D. thesis, University of Waterloo.

    Google Scholar 

  • Lucchesi, C. and Younger, D. (1978). A minimax theorem for directed graphs. Journal of the London Mathematical Society, 17:369–374.

    MathSciNet  Google Scholar 

  • McWhirter, I. and Younger, D. (1971). Strong covering of a bipartite graph. Journal of the London Mathematical Society, 3:86–90.

    MathSciNet  Google Scholar 

  • Melkonian, V. and Tardos, É. (1999). Approximation algorithms for a directed network design problem. IPCO, 345–360.

    Google Scholar 

  • Pulleyblank, W.R. (1994). Personal cominunication.

    Google Scholar 

  • Schrijver, A. (1980). A counterexample to a conjecture of Edmonds and Giles. Discrete Mathematics, 32:213–214.

    MATH  MathSciNet  Google Scholar 

  • Schrijver, A. (1982). Min-max relations for directed graphs. Annals of Discrete Mathematics, 16:261–280.

    MATH  MathSciNet  Google Scholar 

  • Schrijver, A. (2000). A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80:346–355.

    MATH  MathSciNet  CrossRef  Google Scholar 

  • Schrijver, A. Combinatorial Optimization: Polyhedra and Efficiency. Springer Verlag, Berlin.

    Google Scholar 

  • Wallacher, C. and Zimmermann, U. (1999). A polynomial cycle canceling algorithm for submodular flows. Mathematical Programming, Series A, 86(1):1–15.

    MathSciNet  CrossRef  Google Scholar 

  • Williamson, D., Goemans, M., Mihail, M., and Vazirani, V. (1995). A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica, 15:435–454.

    MathSciNet  CrossRef  Google Scholar 

  • Younger, D. (1963). Feedback in a directed graph. Ph.D. thesis, Columbia University.

    Google Scholar 

  • Younger, D. (1969). Maximum families of disjoint directed cuts. In: Recent Progress in Combinatorics, pp. 329–333, Academic Press, New York.

    Google Scholar 

  • Zimmermann, U. (1982). Minimization on submodular flows. Discrete Applied Mathematics, 4:303–323.

    MATH  MathSciNet  CrossRef  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Shepherd, F., Vetta, A. (2005). Visualizing, Finding and Packing Dijoins. In: Avis, D., Hertz, A., Marcotte, O. (eds) Graph Theory and Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-387-25592-3_8

Download citation