GridMaze-Algorithm/algorithm.bib at master · txyyss/GridMaze-Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
@inproceedings{Xu:2007:ImageMaze,
 author = {Xu, Jie and Kaplan, Craig S.},
 title = {Image-guided maze construction},
 booktitle = {ACM SIGGRAPH 2007 papers},
 series = {SIGGRAPH '07},
 year = {2007},
 location = {San Diego, California},
 articleno = {29},
 url = {http://doi.acm.org/10.1145/1275808.1276414},
 doi = {10.1145/1275808.1276414},
 acmid = {1276414},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {halftoning, labyrinth, line drawing, maze, streamline},
}

@misc{ wiki:mazeGen,
   author = "Wikipedia",
   title = "Maze generation algorithm --- Wikipedia{,} The Free Encyclopedia",
   year = "2012",
   url = "\url{http://en.wikipedia.org/w/index.php?title=Maze_generation_algorithm&oldid=509956138}",
   note = "[Online; accessed 31-August-2012]"
 }

@book{clrs,
 author = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford},
 title = {Introduction to Algorithms, Third Edition},
 year = {2009},
 isbn = {0262033844, 9780262033848},
 edition = {3rd},
 publisher = {The MIT Press},
}

@book{Garey:1979:CIG:578533,
 author = {Garey, Michael R. and Johnson, David S.},
 title = {Computers and Intractability: A Guide to the Theory of NP-Completeness},
 year = {1979},
 isbn = {0716710447},
 publisher = {W. H. Freeman \& Co.},
 address = {New York, NY, USA},
}

@article{citeulike:1905588,
    author = {Itai, Alon and Papadimitriou, Christos H. and Szwarcfiter, Jayme L.},
    journal = {SIAM Journal on Computing},
    keywords = {circuit, complete, graphs, grid, hamiltonian, np, path},
    number = {4},
    pages = {676--686},
    priority = {4},
    publisher = {SIAM},
    title = {{Hamilton Paths in Grid Graphs}},
    url = {http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal\&id=SMJCAT000011000004000676000001\&idtype=cvips\&gifs=yes},
    volume = {11},
    year = {1982}
}

@inproceedings{Lenhart:1997:HCS:795663.796334,
 author = {Lenhart, William and Umans, Christopher},
 title = {Hamiltonian Cycles in Solid Grid Graphs},
 booktitle = {Proceedings of the 38th Annual Symposium on Foundations of Computer Science},
 series = {FOCS '97},
 year = {1997},
 isbn = {0-8186-8197-7},
 pages = {496--},
 url = {http://dl.acm.org/citation.cfm?id=795663.796334},
 acmid = {796334},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
}

@article{Zhang20115340,
title = "Approximating the longest paths in grid graphs",
journal = "Theoretical Computer Science",
volume = "412",
number = "39",
pages = "5340 - 5350",
year = "2011",
note = "",
issn = "0304-3975",
doi = "10.1016/j.tcs.2011.06.010",
url = "http://www.sciencedirect.com/science/article/pii/S0304397511005032",
author = "Wen-Qi Zhang and Yong-Jin Liu",
keywords = "Long paths",
keywords = "Square-free 2-factor",
keywords = "Grid graphs"
}

@misc{ wiki:TSP,
   author = "Wikipedia",
   title = "Travelling salesman problem --- Wikipedia{,} The Free Encyclopedia",
   year = "2012",
   url = "\url{http://en.wikipedia.org/w/index.php?title=Travelling_salesman_problem&oldid=509953085}",
   note = "[Online; accessed 1-September-2012]"
 }

@book{cook2011pursuit,
  title={In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation},
  author={Cook, W.J.},
  isbn={9780691152707},
  lccn={2011030626},
  series={Princeton University Press},
  url={http://books.google.com.hk/books?id=S3bxbr\_-qhYC},
  year={2011},
  publisher={Princeton University Press}
}

@book{1999finding,
  author = {David Applegate and Robert Bixby and Vasek Chvátal and William Cook},
  title={Finding Tours in the TSP},
  series={Report},
  url={http://books.google.com.hk/books?id=gtgGaAEACAAJ},
  year={1999},
  publisher={Sonderforschungsbereich 303}
}

@misc{ wiki:EMST,
   author = "Wikipedia",
   title = "Euclidean minimum spanning tree --- Wikipedia{,} The Free Encyclopedia",
   year = "2012",
   url = "\url{http://en.wikipedia.org/w/index.php?title=Euclidean_minimum_spanning_tree&oldid=496347642}",
   note = "[Online; accessed 2-September-2012]"
 }

@book{Berg:2008:CGA:1370949,
 author = {Berg, Mark de and Cheong, Otfried and Kreveld, Marc van and Overmars, Mark},
 title = {Computational Geometry: Algorithms and Applications},
 year = {2008},
 isbn = {3540779736, 9783540779735},
 edition = {3rd ed.},
 publisher = {Springer-Verlag TELOS},
 address = {Santa Clara, CA, USA},
}