Packing Steiner trees: Polyhedral investigations

被引：0
|
作者：
Grotschel, M.
Martin, A.
Weismantel, R.
机构：
来源：
Mathematical Programming, Series A | 1996年 / 72卷 / 02期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Packing Steiner trees: Polyhedral investigations
    Grotschel, M
    Martin, A
    Weismantel, R
    MATHEMATICAL PROGRAMMING, 1996, 72 (02) : 101 - 123
  • [2] Packing Steiner trees
    Jain, K
    Mahdian, M
    Salavatipour, MR
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 266 - 274
  • [3] Packing Steiner trees
    DeVos, Matt
    McDonald, Jessica
    Pivotto, Irene
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 178 - 213
  • [4] Packing the Steiner Trees of a Graph
    Petingi, L.
    Talafha, M.
    NETWORKS, 2009, 54 (02) : 90 - 94
  • [5] Packing Steiner trees on four terminals
    Kriesell, Matthias
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (06) : 546 - 553
  • [6] Packing Steiner trees: Further facets
    Grotschel, M
    Martin, A
    Weismantel, R
    EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (01) : 39 - 52
  • [7] Packing Steiner trees: Separation algorithms
    Grotschel, M
    Martin, A
    Weismantel, R
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1996, 9 (02) : 233 - 257
  • [8] Packing Element-Disjoint Steiner Trees
    Cheriyan, Joseph
    Salavatipour, Mohammad R.
    ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (04)
  • [9] Packing element-disjoint Steiner trees
    Cheriyan, J
    Salavatipour, MR
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2005, 3624 : 52 - 61
  • [10] Hardness and approximation results for packing Steiner trees
    Cheriyan, J
    Salavatipour, MR
    ALGORITHMICA, 2006, 45 (01) : 21 - 43
12345