Approximability of Packing Disjoint Cycles

Packing directed circuits fractionally

Paul Seymour · COMBINATORICA · 1995 · 226 citations

Circuit Complexity, Mathematical Programming, Engineering +4

A PCP characterization of NP with optimal amortized query complexity

Alex Samorodnitsky, Luca Trevisan · 2000 · 174 citations

Computational Complexity Theory, Engineering, Computational Complexity +17

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman et al. · Journal of Computer and System Sciences · 2003 · 137 citations

Mathematical Programming, Related Problems, Engineering +15

Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion

Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna et al. · 2005 · 72 citations

Mathematical Programming, Network Routing Algorithm, Computational Complexity Theory +15

Hardness of the undirected edge-disjoint paths problem

Matthew Andrews, Lisa Zhang · 2005 · 70 citations

Mathematical Programming, 3-ε M Approximation, Directed Graph +14