Edge-minimum graphs that satisfy a symmetric supermodular connectivity demand

by András A. Benczúr and András Frank

Math. Prog. B 84(3):483--504

ps.gz ps pdf

Document in Citeseer database

Abstract

Related articles

Applications Of Relaxed Submodularity (1998)
a nice survey

Citations

1. Nagamochi H, Shiraki T, Ibaraki T
   Augmenting a submodular and posi-modular set function by a multigraph
   J COMB OPTIM 5 (2): 175-212 JUN 2001
2. Nagamochi H
   Recent development of graph connectivity augmentation algorithms
   IEICE T INF SYST E83D: (3) 372-383 MAR 2000
3. Fleiner, Tamás and Tibor Jordán
   Coverings and structure of crossing families
   Math. Prog. B 84(3):505--518 (1999)