S. Chopra and L. H. Owen. Extended Formulations for the A-cut Problem. Preprint, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Improved Approximation Algorithm for Multiway Cut - Calinescu, Karloff, Rabani (1998) (16 citations) (Correct)
.... in polynomial time [9] For trees and 2 trees, there are linear time algorithms [6] For dense unweighted graphs, there is a polynomial time approximation scheme [2, 12] Chopra and Rao [6] and Cunningham [7] develop a polyhedral approach to Multiway Cut, further extended by Chopra and Owen [5]. These provide useful tips to the implementation of branch andcut type heuristics that are reported by the authors to work well in practice. Bertsimas et al. 4] propose a non linear formulation of Multiway Cut and related problems. They suggest several polynomial time solvable relaxations, and ....
S. Chopra and L. H. Owen. Extended Formulations for the A-cut Problem. Preprint, 1994.
Multiway Cut - Calinescu, Karloff, Rabani (1998) (Correct)
.... in polynomial time [9] For trees and 2 trees, there are linear time algorithms [6] For dense unweighted graphs, there is a polynomial time approximation scheme [2, 12] Chopra and Rao [6] and Cunningham [7] develop a polyhedral approach to Multiway Cut, further extended by Chopra and Owen [5]. These provide useful tips to the implementation of branch andcut type heuristics that are reported by the authors to work well in practice. Bertsimas et al. 4] propose a non linear formulation of Multiway Cut and related problems. They suggest several polynomial time solvable relaxations, and ....
S. Chopra and L. H. Owen. Extended Formulations for the A-cut Problem. Preprint, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC