zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems. (English) Zbl 1030.90094
Summary: In their seminal paper, Frank and Jordán show that a large class of optimization problems including certain directed edge augmentation ones fall into the class of covering supermodular functions over pairs of sets. They also give an algorithm for such problems, however, that relies on the ellipsoid method. Our main result is a combinatorial algorithm for the restricted covering problem when the supermodular function is 0-1 valued; the problem includes directed vertex or $S-T$ connectivity augmentation by one. Our algorithm uses an approach completely different from that of an independent recent result of Frank. It finds covers of partially ordered sets that satisfy natural abstract properties slightly extending those in Frank and Jordán. The algorithm resembles primal--dual augmenting path algorithms: For an initial (possibly greedy) cover the algorithm searches for witnesses for the necessity of each element in the cover. If no two witness have a common cover, the solution is optimal. As long as this is not the case, the witnesses are gradually exchanged by smaller ones (PUSHDOWN step). Each witness change defines an appropriate change in the solution; these changes are finally unwound in a shortest path manner to obtain a solution of size one less (REDUCE step).

90C27Combinatorial optimization
68W05Nonnumerical algorithms
68R10Graph theory in connection with computer science (including graph drawing)
Full Text: DOI
[1] A.A. Benczúr, Parallel and fast sequential algorithms for undirected edge connectivity augmentation, Math. Prog. B 84(3) (1999) 595--640; Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 658--667.
[2] A.A. Benczúr, J. Förster, Z. Király, Dilworth’s theorem and its application for path systems of a cycle--implementation and analysis. Proceedings of the European Symposium Algebra, Springer, Lecture Notes in Computer Science, Vol. 1643, 1999, pp. 598--509. · Zbl 0946.05049
[3] A.A. Benczúr, D.R. Karger, Augmenting undirected edge-connectivity in O \tilde{}(n2) time J. Alg. 37(1), (2000) 2--36; Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 500--509. · Zbl 0962.68135
[4] Cai, G. -P.; Sun, Y. -G.: The minimum augmentation of any graph to a k-edge-connected graph. Networks 19, 151-172 (1989) · Zbl 0672.05057
[5] A. Frank, Combinatorial algorithms, algorithmic proofs, Doctoral Thesis, Budapest, Eötvös University, 1976 (in Hungarian).
[6] A. Frank, Augmenting graphs to meet edge connectivity requirements, SIAM J. Discr. Math. 5(1) (1992), 25--53; Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990. · Zbl 0782.05054
[7] Frank, A.: Finding minimum generators of path systems. J. combin. Theory B 75, 237-244 (1999) · Zbl 0938.05036
[8] A. Frank, Finding minimum weighted generators of a path system, in: R.L. Graham, J. Kratochvil, J. Nesetril, F.S. Roberts (Eds.), Contemporary Trends in Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, Providence, Rhode Island, Vol. 49, 1999, pp. 129--138. · Zbl 0978.90103
[9] A. Frank, Finding minimum edge-coverings of pairs of subsets, EGRES Technical Report Series (2001). Available at http://www.cs.elte.hu/egres/
[10] Frank, A.; Jordán, T.: Minimal edge-coverings of pairs of sets. J. combin. Theory B 65, 73-110 (1995) · Zbl 0830.05051
[11] Franzblau, D. S.; Kleitman, D. J.: An algorithm for constructing polygons with rectangles. Inform. control 63, 164-189 (1984) · Zbl 0591.68073
[12] Ford, L. R.; Fulkerson, D. R.: Flows in networks. (1962) · Zbl 0106.34802
[13] H.N. Gabow, Efficient splitting off algorithms for graphs, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 696--705.
[14] Goemans, M. X.; Williamson, D. P.: The primal-dual method for approximation algorithms and its application to network design problems. Approximation algorithms for NP-hard problems (1997)
[15] Grötschel, M.; Lovász, L.; Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197 (1981) · Zbl 0492.90056
[16] Gyo?ri, E.: A MIN--MAX theorem on intervals. J. combin. Theory B 37, 1-9 (1984)
[17] Hopcroft, J. E.; Karp, R. M.: An n5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comp. 2, 225-231 (1973) · Zbl 0266.05114
[18] Jordán, T.: On the optimal vertex connectivity augmentation. J. combin. Theory ser. B 63, 8-20 (1995) · Zbl 0824.05042
[19] D.R. Karger, M.S. Levine, Finding maximum flows in simple undirected graphs is easier than bipartite matching, Proceedings of the 30th ACM Symposium on Theory of Computing, 1998. · Zbl 1028.68106
[20] D.E. Knuth, Irredundant intervals, ACM J. Experimental Algorithmics 1 (1996) (article1, pp.19). · Zbl 1073.68697
[21] Lubiw, A.: A weighted MIN--MAX relation for intervals. J. combin. Theory B 53, 151-172 (1991) · Zbl 0758.05003
[22] D. Naor, D. Gusfield, Ch. Martel, A fast algorithm for optimally increasing the edge connectivity, Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 698--707.
[23] Watanabe, T.; Nakamura, A.: Edge connectivity augmentation problems. J. comput. System sci. 35, 96-144 (1987) · Zbl 0622.68057