Journal: SIAM Journal on Discrete Mathematics

Found 4 papers in total
A 5/8 approximation algorithm for the maximum asymmetric traveling salesperson problem
A 5/8 approximation algorithm for the maximum asymmetric traveling salesperson problem
2003,
The maximum asymmetric traveling salesperson problem, also known as the taxicab...
Graph partitioning and continuous quadratic programming
Graph partitioning and continuous quadratic programming
1999,
A continuous quadratic programming formulation is given for min-cut graph partitioning...
A 3/2-approximation algorithm for the mixed postman problem
A 3/2-approximation algorithm for the mixed postman problem
1999,
The mixed postman problem, a generalization of the Chinese postman problem, is that of...
The compactness of interval routing
The compactness of interval routing
1999,
The compactness of a graph measures the space complexity of its shortest path routing...
Papers per page: