最 低 价：￥99.00
定 价：￥465.30
作 者：Adam L. Buchsbaum 等编 著
出 版 社：Oversea Publishing House
出版时间：2001-10-1
I S B N：9783540425601
| ALENEX'01 Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems S.P. Fekete (TU Berlin), H. Meijer (Queen's University), A. Rohe(Universitiit Bonn), and W. Tietze (TU Berlin) CNOP - A Package for Constrained Network Optimization K. Mehlhorn and M. Ziegelmann (MPI Saarbriicken) The Asymmetric Traveling Salesman Problem:Algorithms, Instance Generators, and Tests J. Cirasella (Boston Arch. Center Library), D.S. Johnson (ATST),L.A. McGeoch, (Amherst College), and W. Zhang (WUSTL) Network Tomography through End-to-End Measurements D. Towsley (U Mass., Amherst) Experimental Results on Statistical Approaches to Page Replacement Policies V. Leung (Sandia National Laboratories) and S. Irani (University of California, Irvine) Estimating Resemblance of MIDI Documents M. Mitzenmacher and S. Owen (Harvard) Experiments on Adaptive Set Intersections for Text Retrieval Systems E.D. Demaine (U Waterloo), A. Ldpez-Ortiz (Univ. of New Brunswick),and J.L Munro (U Waterloo) PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets S. Sethia, M. Held, and J.S.B. Mitchell (SUNY Stony Brook) Hierarchical Clustering of Trees: Algorithms and Experiments L Finocchi and R. Petresehi (Universitd di Roma "La Sapienza") Travel Planning with Self-Made Maps U. Brandes, F. Schulz, D. Wagner, and T. Willhalm (University Konstanz) New Algorithmic Challenges Arising in Measurement-Driven Networking Research W. Willinger (ATSJT Labs) A Probabilistic Spell for the Curse of Dimensionality E. Chdvez (Univ. Michoacana) and G. Navarro (Univ. of Chile) Experimental Evaluation of the Height of a Random Set of Points in a d-dimensional Cube E. Breimer, M. Goldberg, B. Kolstad, and M. Magdon-Ismail (RPI) An Empirical Study of a New Approach to Nearest Neighbor Searching S. Maneewongvatana and D.M. Mount (Univ. of Maryland) Spectral Analysis for Data Mining A.R. Karlin (U. Washington) Trade Off Between Compression and Search Times in Compact Suffix Array V. Makinen (U. Helsinki) Implementation of a PTAS for Scheduling with Release Dates C. Hepner and C. Stein (Dartmouth College) Biased Skip Lists for Highly Skewed Access Patterns F. Ergun (Case Western), S.C.Sahinalp, and J. Sharp (Case Western;University of Warwick), R.K. Sinha (Bell Labs) Author Index |
内容加载中，请稍后...
商品评论（0条）