Matching is as easy as matrix inversion
Combinatorica
Approximating Capacitated Routing and Delivery Problems
SIAM Journal on Computing
Better approximations for max TSP
Information Processing Letters
A 7/8-approximation algorithm for metric Max TSP
Information Processing Letters
SIAM Journal on Discrete Mathematics
Paths, Trees, and Minimum Latency Tours
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
35/44-Approximation for asymmetric maximum TSP with triangle inequality
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We present approximation algorithms for four variations of the maximum latency problem. We consider symmetric graphs and asymmetric graphs and both with general edge weights or weights satisfying the triangle inequality. Moreover, in each variation the starting point of the tour may either be given in the input or be a decision variable. As a tool for our solution, we use a PTAS for the maximum partial cover problem. The input to this problem is an edge weighted complete graph and an integer k, and the goal is to compute a maximum weight set of disjoint simple cycles on exactly k vertices.