Pierluigi Crescenzi, Riccardo Silvestri, and Luca Trevisan. On weighted vs unweighted versions of combinatorial optimization problems. Information and Computation, 167(1):10-26, May 2001. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Is Constraint Satisfaction Over Two Variables Always Easy? - Engebretsen, Guruswami (2002) (1 citation) (Correct)
....This is almost the result we want except that we only showed hardness for weighted graphs. However, one can deduce inapproximability within the same factor also for unweighted graphs by appealing to a general procedure for getting rid of weights due to Crescenzi, Silvestri, and Trevisan [5]. The result of Theorem 9 is not entirely subsumed by the result of Theorem 10 for satisfiable instances, since the constant in front of 1 d implies that the result of Theorem 9 will actually be stronger for small values of d. An interesting question is whether a factor (1 (d 2 ) hardness ....
Pierluigi Crescenzi, Riccardo Silvestri, and Luca Trevisan. On weighted vs unweighted versions of combinatorial optimization problems. Information and Computation, 167(1):10-26, May 2001.
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