Greg N. Frederickson
- 1 BUSACKER, R G, AND SAATY, T L Fmae Graphs and Networks McGraw-Hall, New York, 1965Google Scholar
- 2 CHRISTOFIDES, N Worst-case analys~s of a new heuristic for the travehng salesman problem Manage Sc, Res Rep No 388, Carnegie-Mellon U, Pmsburgh, Pa, 1976Google Scholar
- 3 COOK S A The complexity of theorem-proving procedures Proc Third Annual ACM Symp Theory of Comptng, Shaker Heights, Ohio, May 1971, pp 151-158 Google Scholar
- 4 EDMONDS, J The Chinese postman problem Oper Res 13, Suppl 1 (1965), B73-B77Google Scholar
- 5 EDMONDS, J, AND JOHNSON, E L Matching, Euler tours and the Chmese postman Math Programming 5 (1973), 88-124Google Scholar
- 6 FLOYD, R Algorithm 97 Shortest path Comm A CM 5, 6 (June 1962), 345 Google Scholar
- 7 FORD, L R, AND FULKERSON, D R Flows m Networks Prmceton U Press, Princeton, N J, 1962Google Scholar
- 8 FEDREDERICKSON, G N, HECHT, M S, AND KIM, C E Approx,mation algorithms for some routmg problems Slam J Comptng 7 (1978), 178-193Google Scholar
- 9 GABOW, H, AND LAWLER, E L An efficient ~mplementat~on of Edmonds' algorithm for maximum weight matching on graphs TR CU-CS-075-75, Dept Comptr Sct, U of Colorado, Boulder, Colo, 1975Google Scholar
- 10 GAREY, M R, AND JOHNSON, D.S. Approxtmatton algorithms for combinatorial problems. An annotated bibhography In Algorithms and Complemty Recent Results and New D:recUons, J.F Traub, Ed, Academic Press, New York, 1976Google Scholar
- 11 IBARRA, O.H., AND KXM, C E Fast approxtmatton algorithms for the knapsack and sum of subset problems J A CM 22, 4 (Oct. 1975), 463--468. Google Scholar
- 12 JOriNSON, D S Approxlmatton algorithms for combinatorial problems J Comptr. Syst Sc~. 9 (1974), 256- 278Google Scholar
- 13 KARP, R M Reductbdtty among combmatorlal problems In Complex:ty of Computer Computanons, R E Miller and J W Thatcher, Eds, Plenum Press, New York, 1972, pp 85-104Google Scholar
- 14 LAWLER, E L Combinatorial Opt:mtzat:ons Networks and Matro:ds Holt, Rinehart, and Winston, New York, 1976Google Scholar
- 15 LENSTRA, J ,K, AND RINNOOY KAN, A H G On general routing problems Networks 6 (1976), 273-280Google Scholar
- 16 MEt-Ko, K Graphtc programming usmg odd or even points Chinese Mathematics I (1962), 237-277Google Scholar
- 17 ORLOFF, C S A fundamental problem m vehtcle routing Networks 4 (1974), 35-64Google Scholar
- 18 ORLOFF, C S On general routmg problems Comments Networks 6 (1976), 281-284Google Scholar
- 19 PAPADIMITRIOU, C H On the complexity of edge traversmg JACM 23, 3 (July 1976), 544-554 Google Scholar
- 20 ROSENKRANTZ, D J, STEARNS, R E, AND LEWIS, P M An analysts of several heurtstlcs for the travehng salesman problem SIAM J Comptng 6 (1977), 115-124Google Scholar
- 21 SAHNI, S K Approximate algorithms for the 0/1 knapsack problem JACM 22, 1 (Jan 1975), 115-124 Google Scholar
Index Terms
- Approximation Algorithms for Some Postman Problems
Recommendations
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
COCOA 2015: Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486A d-clique in a graph $$G = V, E$$G=V,E is a subset $$S\subseteq V$$S⊆V of vertices such that for pairs of vertices $$u, v\in S$$u,v∈S, the distance between u and v is at most d in G. A d-club in a graph $$G = V, E$$G=V,E is a subset $$S'\subseteq V$$S'⊆...
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
In this paper we study the (in)approximability of two distance-based relaxed variants of the maximum clique problem (Max Clique), named Max d-Clique and Max d-Club: A d-clique in a graph $$G = (V, E)$$G=(V,E) is a subset $$S\subseteq V$$S⊆V of vertices ...
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
We analyze approximation algorithms for several variants of the traveling salesman problem with multiple objective functions. First, we consider the symmetric TSP (STSP) with ź-triangle inequality. For this problem, we present a deterministic ...
Comments