SEARCH

SEARCH BY CITATION

Cited in:

CrossRef

This article has been cited by:

  1. 1
    David Adjiashvili, Sebastian Stiller, Rico Zenklusen, Bulk-Robust combinatorial optimization, Mathematical Programming, 2014,

    CrossRef

  2. 2
    Jochen Könemann, Ojas Parekh, David Pritchard, Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation, Algorithmica, 2014, 68, 3, 776

    CrossRef

  3. 3
    J. Cheriyan, B. Laekhanukit, Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs, SIAM Journal on Discrete Mathematics, 2013, 27, 3, 1450

    CrossRef

  4. 4
    Jittat Fakcharoenphol, Bundit Laekhanukit, An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem, SIAM Journal on Computing, 2012, 41, 5, 1095

    CrossRef

  5. 5
    Harold N. Gabow, Suzanne R. Gallagher, Iterated Rounding Algorithms for the Smallestk-Edge Connected Spanning Subgraph, SIAM Journal on Computing, 2012, 41, 1, 61

    CrossRef

  6. 6
    Viswanath Nagarajan, R. Ravi, Mohit Singh, Simpler analysis of LP extreme points for traveling salesman and survivable network design problems, Operations Research Letters, 2010, 38, 3, 156

    CrossRef