A Priori Bounds on the Euclidean Traveling Salesman
- 期刊名称SIAM Journal on Computing
- 作者Snyder, Timothy Law; Steele, J. Michael
- 卷第24卷
- 期第3期
- 印刷ISSN0097-5397
- 电子ISSN1095-7111
- 文件大小898.97KB
- 发表时间1995-06
- DOI10.1137/s0097539792226771
- 页码665-671
Level number sequences for treesPhilippe Flajolet; Helmut Prodinger · 1987
How to select a loserHelmut Prodinger · 1993
On monotone functions of tree structuresHelmut Prodinger; Friedrich J. Urbanek · 1983
Language operators related to InitHelmut Prodinger; Friedrich J. Urbanek · 1979
Further results on digital search treesPeter Kirschenhofer; Helmut Prodinger · 1988
PrefaceHelmut Prodinger; Wojciech Szpankowski · 1995
Return statistics of simple random walksPeter Kirschenhofer; Helmut Prodinger · 1996
Carry propagation in signed digit representationsClemens Heuberger; Helmut Prodinger · 2003
On Three-Dimensional PackingLi, Keqin; Cheng, Kam-Hoi · SIAM Journal on Computing · 1990
Priority Search TreesMcCreight, Edward M. · SIAM Journal on Computing · 1985
Scheduling Split IntervalsBar-Yehuda, R.; Halldórsson, M. M.; Naor, J. (S.); Shachnai, H.; Shapira, I. · SIAM Journal on Computing · 2006
Nondeterminism within $P^ * $Buss, Jonathan F.; Goldsmith, Judy · SIAM Journal on Computing · 1993
Optimization of Straight Line ProgramsAho, Alfred V.; Ullman, Jeffrey D. · SIAM Journal on Computing · 1972
Quantum Entanglement and Communication ComplexityBuhrman, Harry; Cleve, Richard; van Dam, Wim · SIAM Journal on Computing · 2001
On Classes of Program SchemataConstable, Robert L.; David, Gries · SIAM Journal on Computing · 1972
Bounded Concurrent Time-StampingDolev, Danny; Shavit, Nir · SIAM Journal on Computing · 1997