| |
| | Approximation Algorithms for the 0-Extension Problem - Calinescu, Karloff, Rabani (ResearchIndex) (Site not responding. Last check: 2007-10-08) |
 | | Abstract: In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. |
 | | This problem generalizes the multiway cut problem of Dahlhaus, Johnson, Papadimitriou, Seymour, and Yannakakis and is closely related to the metric... |
 | | Approximation algorithms for the 0-extension problem, this proceedings. |
| citeseer.ist.psu.edu /375653.html (478 words) |
|