-
1
-
-
0030781799
-
The angular-metric traveling salesman problem
-
January 05-07, New Orleans, Louisiana, United States
-
Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber, The angular-metric traveling salesman problem, Proceedings of the eighth annual ACMSIAM symposium on Discrete algorithms, p.221-229, January 05-07, 1997, New Orleans, Louisiana, United States
-
(1997)
Proceedings of the eighth annual ACMSIAM symposium on Discrete algorithms
, pp. 221-229
-
-
Aggarwal, A.1
Coppersmith, D.2
Khanna, S.3
Motwani, R.4
Schieber, B.5
-
2
-
-
38249003047
-
-
June, doi〉10.1016/0925-7721(93)90027-4
-
Muhammad H. Alsuwaiyel, D. T. Lee, Minimal link visibility paths inside a simple polygon, Computational Geometry: Theory and Applications, v.3 n.1, p.1-25, June 1993 [doi〉10.1016/0925-7721(93)90027-4]
-
(1993)
Minimal link visibility paths inside a simple polygon, Computational Geometry: Theory and Applications
, vol.3
, Issue.1
, pp. 1-25
-
-
Muhammad, H.1
Alsuwaiyel, D.2
Lee, T.3
-
3
-
-
0013057171
-
-
Information Processing Letters, v, July 21, doi〉10.1016/0020-0190(95)00072-K
-
Muhammad H. Alsuwaiyel, D. T. Lee, Finding an approximate minimum-link visibility path inside a simple polygon, Information Processing Letters, v.55 n.2, p.75-79, July 21, 1995 [doi〉10.1016/0020-0190(95)00072-K]
-
(1995)
Finding an approximate minimum-link visibility path inside a simple polygon
, vol.55
, Issue.2
, pp. 75-79
-
-
Muhammad, H.1
Alsuwaiyel, D.2
Lee, T.3
-
4
-
-
0346172087
-
Optimal covering tours with turn costs
-
Technical Report 674, TU Berlin, Available at
-
E. M. Arkin, M. A. Bender, E. D. Demaine, S. P. Fekete, J. S. B. Mitchell, and S. Sethia. Optimal covering tours with turn costs. Technical Report 674, TU Berlin, 2000. Available at http://www.math.tu-berlin. de/coga/publications/techreports/2000/ Report-674-2000.html.
-
(2000)
-
-
Arkin, E.M.1
Bender, M.A.2
Demaine, E.D.3
Fekete, S.P.4
Mitchell, J.S.B.5
Sethia, S.6
-
5
-
-
64049097014
-
-
E. M. Arkin, S. P. Fekete, and J. S. B. Mitchell. The lawnmower problem. In Proc. 5th Canad. Conf. Comput. Geom., pp. 461-466, 1993.
-
E. M. Arkin, S. P. Fekete, and J. S. B. Mitchell. The lawnmower problem. In Proc. 5th Canad. Conf. Comput. Geom., pp. 461-466, 1993.
-
-
-
-
6
-
-
0037894062
-
-
Oct, doi〉10.1016/S0925- 7721(00)00015-8
-
Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell, Approximation algorithms for lawn mowing and milling, Computational Geometry: Theory and Applications, v.17 n.1-2, p.25-50, Oct. 2000 [doi〉10.1016/S0925- 7721(00)00015-8]
-
(2000)
Approximation algorithms for lawn mowing and milling, Computational Geometry: Theory and Applications
, vol.17
, Issue.1-2
, pp. 25-50
-
-
Arkin, E.M.1
Fekete, S.P.2
Mitchell, J.S.B.3
-
7
-
-
8444226342
-
Optimization problems related to zigzag pocket machining
-
E. M. Arkin, M. Held, and C. L. Smith. Optimization problems related to zigzag pocket machining. Algorithmica, 26(2), pp. 197-236, 2000.
-
(2000)
Algorithmica
, vol.26
, Issue.2
, pp. 197-236
-
-
Arkin, E.M.1
Held, M.2
Smith, C.L.3
-
8
-
-
64049112095
-
Minimumlink watchman tours
-
Technical report, SUNY Stony Brook
-
E.M. Arkin, J. S. B. Mitchell, and C. Piatko. Minimumlink watchman tours. Technical report, SUNY Stony Brook, 1994.
-
(1994)
-
-
Arkin, E.M.1
Mitchell, J.S.B.2
Piatko, C.3
-
9
-
-
0031645196
-
Approximation algorithms for multiple-tool miling
-
June 07-10, Minneapolis, Minnesota, United States [doi〉10.1145/276884.276918
-
Sunil Arya, Siu-Wing Cheng, David M. Mount, Approximation algorithms for multiple-tool miling, Proceedings of the fourteenth annual symposium on Computational geometry, p.297-306, June 07-10, 1998, Minneapolis, Minnesota, United States [doi〉10.1145/276884.276918]
-
(1998)
Proceedings of the fourteenth annual symposium on Computational geometry
, pp. 297-306
-
-
Arya, S.1
Cheng, S.-W.2
Mount, D.M.3
-
10
-
-
77957088264
-
-
A. A. Assad and B. L. Golden. Arc routing methods and applications. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Routing, 8 of Handbooks in Operations Research and Management Science, pp. 375-483. Elsevier Science, Amsterdam, 1995.
-
A. A. Assad and B. L. Golden. Arc routing methods and applications. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Routing, volume 8 of Handbooks in Operations Research and Management Science, pp. 375-483. Elsevier Science, Amsterdam, 1995.
-
-
-
-
11
-
-
0033225636
-
The Directed Rural Postman Problem with Turn Penalties
-
April
-
Enrique Benavent, David Soler, The Directed Rural Postman Problem with Turn Penalties, Transportation Science, v.33 n.4, p.408-418, April 1999
-
(1999)
Transportation Science
, vol.33
, Issue.4
, pp. 408-418
-
-
Benavent, E.1
Soler, D.2
-
12
-
-
51249179364
-
Triangulating a simple polygon in linear time
-
Bernard Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, v.6 n.5, p.485-524, 1991
-
(1991)
Discrete & Computational Geometry
, vol.6
, Issue.5
, pp. 485-524
-
-
Chazelle, B.1
-
13
-
-
64049093256
-
-
3. Clossey, G. Laporte, and P. Soriano. Solving arc routing problems with turn penalties. Technical Report G-2000-05, Le Groupe d'etudes et de recherche en analyse des decisions, Montreal, Canada, 2000.
-
3. Clossey, G. Laporte, and P. Soriano. Solving arc routing problems with turn penalties. Technical Report G-2000-05, Le Groupe d'etudes et de recherche en analyse des decisions, Montreal, Canada, 2000.
-
-
-
-
14
-
-
0041763211
-
-
Information Processing Letters, v, Dec, doi〉10.1016/S0020-0190(98)00178-1
-
Michael J. Collins, Bernard M. E. Moret, Improved lower bounds for the link length of rectilinear spanning paths in grids, Information Processing Letters, v.68 n.6, p.317-319, Dec 1998 [doi〉10.1016/S0020-0190(98)00178-1]
-
(1998)
Improved lower bounds for the link length of rectilinear spanning paths in grids
, vol.68
, Issue.6
, pp. 317-319
-
-
Collins, M.J.1
Moret, B.M.E.2
-
15
-
-
0000238217
-
Arc routing problems, part I: The Chinese postman problem
-
H. A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems, part I: The Chinese postman problem. Operations Research, 43(2), pp. 231-242, 1995.
-
(1995)
Operations Research
, vol.43
, Issue.2
, pp. 231-242
-
-
Eiselt, H.A.1
Gendreau, M.2
Laporte, G.3
-
16
-
-
0000624218
-
Arc routing problems, part II: The rural postman problem
-
H. A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems, part II: The rural postman problem. Operations Research, 43(3), pp. 399-414, 1995.
-
(1995)
Operations Research
, vol.43
, Issue.3
, pp. 399-414
-
-
Eiselt, H.A.1
Gendreau, M.2
Laporte, G.3
-
17
-
-
0041120435
-
-
Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada
-
S. P. Fekete. Geometry and the Travelling Salesman Problem. Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, 1992.
-
(1992)
Geometry and the Travelling Salesman Problem
-
-
Fekete, S.P.1
-
18
-
-
0043100099
-
-
Sept, doi〉10.1016/S0925-7721(96)00012-0
-
Sándor P. Fekete, Gerhard J. Woeginger, Angle-restricted tours in the plane, Computational Geometry: Theory and Applications, v.8 n.4, p.195-218, Sept. 1997 [doi〉10.1016/S0925-7721(96)00012-0]
-
(1997)
Angle-restricted tours in the plane, Computational Geometry: Theory and Applications
, vol.8
, Issue.4
, pp. 195-218
-
-
Fekete, S.P.1
Woeginger, G.J.2
-
20
-
-
0003603813
-
-
W. H. Freeman & Co, New York, NY
-
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
-
(1979)
Computers and Intractability: A Guide to the Theory of NP-Completeness
-
-
Garey, M.R.1
Johnson, D.S.2
-
21
-
-
64049091759
-
-
Martin Held, On the computational geometry of pocket machining, Springer-Verlag New York, Inc., New York, NY, 1991
-
Martin Held, On the computational geometry of pocket machining, Springer-Verlag New York, Inc., New York, NY, 1991
-
-
-
-
22
-
-
0000412320
-
Hamilton paths in grid graphs
-
A. Itai, C. H. Papadimitriou, and J. L. Szwarcfiter. Hamilton paths in grid graphs. SIAM J. Comput., 11, pp. 676-686, 1982.
-
(1982)
SIAM J. Comput
, vol.11
, pp. 676-686
-
-
Itai, A.1
Papadimitriou, C.H.2
Szwarcfiter, J.L.3
-
23
-
-
9644306285
-
The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection
-
August 25-27
-
Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki, The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection, Proceedings of the 5th International Symposium on Algorithms and Computation, p.29-37, August 25-27, 1994
-
(1994)
Proceedings of the 5th International Symposium on Algorithms and Computation
, pp. 29-37
-
-
Iwano, K.1
Raghavan, P.2
Tamaki, H.3
-
24
-
-
0002737249
-
Computational complexity and the traveling salesman problem
-
E. Lawler, J. Lenstra, A. R. Kan, and D. Shmoys, editors, John Wiley & Sons, New York
-
D. S. Johnson and C. H. Papadimitriou. Computational complexity and the traveling salesman problem. In E. Lawler, J. Lenstra, A. R. Kan, and D. Shmoys, editors, The Traveling Salesman Problem, pp. 68-74. John Wiley & Sons, New York, 1985.
-
(1985)
The Traveling Salesman Problem
, pp. 68-74
-
-
Johnson, D.S.1
Papadimitriou, C.H.2
-
25
-
-
0042314676
-
Link length of rectilinear Hamiltonian tours on grids
-
E. Kranakis, D. Krizanc, and L. Meertens. Link length of rectilinear Hamiltonian tours on grids. Ars Combinatoria, 38, pp. 177-192, 1994.
-
(1994)
Ars Combinatoria
, vol.38
, pp. 177-192
-
-
Kranakis, E.1
Krizanc, D.2
Meertens, L.3
-
28
-
-
0032667193
-
-
Aug, doi〉10.1137/S0097539796309764
-
Joseph S. B. Mitchell, Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems, SIAM Journal on Computing, v.28 n.4, p.1298-1309, Aug. 1999 [doi〉10.1137/S0097539796309764]
-
(1999)
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems, SIAM Journal on Computing
, vol.28
, Issue.4
, pp. 1298-1309
-
-
Mitchell, J.S.B.1
-
29
-
-
0002008783
-
Geometric shortest paths and network optimization
-
J.-R. Sack and J. Urrutia, editors, chapter 15, pp, Elsevier Science Publishers B.V. North-Holland, Amsterdam
-
J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, chapter 15, pp. 633-701. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
-
(2000)
Handbook of Computational Geometry
, pp. 633-701
-
-
Mitchell, J.S.B.1
-
30
-
-
64049094185
-
-
E. M. Molada and D. S. Ferngmdez. Exact solution of the Chinese postman problem with turn penalties. In XV Congress on Differential Equations and Applications/V Congress on Applied Mathematics, I, II (Spanish), Colecc. Congr., 9, pp. 1111-1115, 1998.
-
E. M. Molada and D. S. Ferngmdez. Exact solution of the Chinese postman problem with turn penalties. In XV Congress on Differential Equations and Applications/V Congress on Applied Mathematics, volume I, II (Spanish), Colecc. Congr., 9, pp. 1111-1115, 1998.
-
-
-
-
31
-
-
0001260940
-
-
March, doi〉10.1016/S0925-7721(99) 00022-X
-
Simeon Ntafos, Watchman routes under limited visibility, Computational Geometry: Theory and Applications, v.1 n.3, p.149-170, March 1992 [doi〉10.1016/S0925-7721(99) 00022-X]
-
(1992)
Watchman routes under limited visibility, Computational Geometry: Theory and Applications
, vol.1
, Issue.3
, pp. 149-170
-
-
Ntafos, S.1
-
32
-
-
0031361464
-
Hamiltonian Cycles in Solid Grid Graphs
-
97, p, October 19-22
-
William Lenhart, Christopher Umans, Hamiltonian Cycles in Solid Grid Graphs, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.496, October 19-22, 1997
-
(1997)
Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS
, pp. 496
-
-
Lenhart, W.1
Umans, C.2
-
33
-
-
84869270439
-
-
D. West. An Introduction to Graph Theory. Prentice Hall, 1995. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal, Online searching with turn cost, Theoretical Computer Science, v.361 n.2, p.342-355, 1 September 2006
-
D. West. An Introduction to Graph Theory. Prentice Hall, 1995. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal, Online searching with turn cost, Theoretical Computer Science, v.361 n.2, p.342-355, 1 September 2006
-
-
-
-
34
-
-
1842435216
-
Minimizing the stabbing number of matchings, trees, and triangulations
-
January 11-14, New Orleans, Louisiana
-
Sándor P. Fekete, Marco E. Lübbecke , Henk Meijer, Minimizing the stabbing number of matchings, trees, and triangulations, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 11-14, 2004, New Orleans, Louisiana
-
(2004)
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
-
-
Fekete, S.P.1
Lübbecke, M.E.2
Meijer, H.3
|