Algorithms and Computation: 11th International Conference, ISAAC 2000 Taipei, Taiwan, December 18–20, 2000 Proceedings PDF
Preview Algorithms and Computation: 11th International Conference, ISAAC 2000 Taipei, Taiwan, December 18–20, 2000 Proceedings
Lecture Notes in Computer Science 1969 EditedbyG.Goos,J.HartmanisandJ.vanLeeuwen 3 Berlin Heidelberg NewYork Barcelona HongKong London Milan Paris Tokyo D.T. Lee Shang-Hua Teng (Eds.) Algorithms and Computation 11th International Conference, ISAAC 2000 Taipei, Taiwan, December 18-20, 2000 Proceedings 1 3 SeriesEditors GerhardGoos,KarlsruheUniversity,Germany JurisHartmanis,CornellUniversity,NY,USA JanvanLeeuwen,UtrechtUniversity,TheNetherlands VolumeEditors D.T.Lee AcademiaSinica InstituteofInformationScience 128AcademiaRoad,Section2,Nankang,Taipei115,Taiwan,R.O.C. E-mail:[email protected] Shang-HuaTeng UniversityofIllinoisatUrbanaChampaign DepartmentofComputerScience and AkamaiTechnologies 500TechnologySquare,Cambridge,MA02139,USA E-mail:[email protected] Cataloging-in-PublicationDataappliedfor DieDeutscheBibliothek-CIP-Einheitsaufnahme Algorithmsandcomputation:11thinternationalconference; proceedings/ISAAC2000,Taipei,Taiwan,December18-20,2000. D.T.Lee;Shang-HuaTeng(ed.).-Berlin;Heidelberg;NewYork; Barcelona;HongKong;London;Milan;Paris;Singapore;Tokyo: Springer,2000 (Lecturenotesincomputerscience;Vol.1969) ISBN3-540-41255-7 CRSubjectClassification(1998):F.2,F.1,C.2,G.2-3,I.3.5,E.1 ISSN0302-9743 ISBN3-540-41255-7Springer-VerlagBerlinHeidelbergNewYork Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer-Verlag.Violationsare liableforprosecutionundertheGermanCopyrightLaw. Springer-VerlagBerlinHeidelbergNewYork amemberofBertelsmannSpringerScience+BusinessMediaGmbH ©Springer-VerlagBerlinHeidelberg2000 PrintedinGermany Typesetting:Camera-readybyauthor,dataconversionbyPTP-Berlin,StefanSossna Printedonacid-freepaper SPIN:10781373 06/3142 543210 Preface ThepapersinthisvolumewereselectedforpresentationattheEleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), and Chennai (1999). Submissions to the conference this year were conducted entirely electroni- cally.ThankstotheexcellentsoftwaredevelopedbytheInstituteofInformation Science,AcademiaSinica,wewereabletocarryoutvirtuallyallcommunication via the World Wide Web. In response to the call for papers, a total of 87 extended abstracts were submitted from 25 countries. Each submitted paper was handled by at least three program committee members, with the assistance of a number of external reviewers, as indicated by the referee list found in the proceedings. There were many more acceptable papers than there was space available in the symposium program, which made the program committee’s task extremely di(cid:14)cult. Finally 46 papers were selected for presentation at the Symposium. In addition to these contributedpapers,theconferencealsoincludedtwoinvitedpresentationsbyDr. Jean-Daniel Boissonnat, INRIA Sophia-Antipolis, France and Professor Jin-Yi Cai, University of Wisconsin at Madison, Wisconsin, USA. It is expected that most of the accepted papers will appear in a more complete form in scienti(cid:12)c journals. We thank all program committee members and the external reviewers for their excellent work, especially given the demanding time constraints; they gave the symposium its distinctive character. We thank all authors who submitted papers for consideration: they all contributed to the high quality of the sympo- sium. Finally, we thank all our colleagues who worked hard to put in place the logistical arrangements of the symposium. December 2000 D. T. Lee Shang-Hua Teng Organization ISAAC 2000 was organized by the Institute of Information Science, Academia Sinica, Taipei, Taiwan, R.O.C. and in cooperation with the Institute of Infor- mation and Computing Machinery (IICM), Taiwan, R.O.C. Program Committee D. T. Lee (Symposium Chair) Academia Sinica, Taiwan (Co-chair) Shang-Hua Teng University of Illinois, USA (Co-chair) Helmut Alt Free University of Berlin, Germany Nina Amenta University of Texas at Austin, USA Gen-Huey Chen National Taiwan University, Taiwan Je(cid:11) Erickson University of Illinois, USA Giuseppe Italiano University of Rome, Italy Kazuo Iwama Kyoto University, Japan Marcos Kiwi University of Chile, Chile Ming-Tat Ko Academia Sinica, Taiwan Kurt Mehlhorn Max Planck Institute, Germany Michael D. Mitzenmacher Harvard University, USA Kunsoo Park Seoul National University, Korea Tadao Takaoka University of Canterbury, New Zealand Takeshi Tokuyama Sendi University, Japan Peng-Jun Wan Illinois Institute of Technology, USA Derick Wood Hong Kong Univ. of Sci. & Tech., Hong Kong Organizing Committee Local arrangements Tsan-sheng Hsu (Academia Sinica) Web pages Ming-Tat Ko (Academia Sinica) Submission Chi-Jen Lu (Academia Sinica) Publication Hsueh-I Lu (Academia Sinica) Treasurer Ting-Yi Sung (Academia Sinica) Technical support Chiou-Feng Wang (Academia Sinica) Publicity Da-Wei Wang (Academia Sinica) VIII Organization Referees Ricardo Baeza Frank Ho(cid:11)mann Chi-Jen Lu Peter Brass Sun-Yuan Hsieh Hsueh-I Lu Massimiliano Caramia Fang-Rong Hsu Lutz Meissner Marco Cesati Tsan-sheng Hsu Shuichi Miyazaki Wei-Mei Chen Valentine Kabanets Gonzalo Navarro Hsin-Hung Chou Astrid Ka(cid:11)anke Rossella Petreschi Kyung-Yong Chwa Adam Klivans Guenter Rote Josep Diaz Christian Knauer Kunihiko Sadakane Stefan Felsner Ulrich Kortenkamp Ting-Yi Sung Qian Ping Gu Klaus Kriegel Da-Wei Wang Cluadio Gutierrez Cheng-Nan Lai Jeng-Jung Wang Xin He Stefano Leonardi Carola Wenk Laura Heinrich-Litan Yaw-Ling Lin Chang-Wu Yu Alejandro Hevia Giuseppe Liotta Moti Yung Chin-Wen Ho Martin Loebl Xiao Zhou Sponsoring Institutions National Science Council of the Republic of China Institute of Information Science, Academia Sinica, Taipei, Taiwan ACM Taipei/Taiwan Chapter The Institute of Information and Computing Machinery (IICM) Table of Contents Invited Presentations Voronoi-Based Systems of Coordinates and Surface Reconstruction::::::: 1 Jean-Daniel Boissonnat (INRIA, Unit(cid:19)e de Sophia Antipolis) Essentially Every Unimodular Matrix De(cid:12)nes an Expander :::::::::::: 2 Jin-Yi Cai (State University of New York at Bu(cid:11)alo, University of Wisconsin) Algorithms and Data Structures (I) Strategies for Hotlink Assignments ::::::::::::::::::::::::::::::::::: 23 Prosenjit Bose, Evangelos Kranakis, Danny Krizanc (Carleton University), Jurek Czyzowicz, Andrzej Pelc (Univ. du Qu(cid:19)ebec (cid:18)a Hull), Leszek Ga(cid:24)sieniec (University of Liverpool), and Miguel V. Martin (Carleton University) A New Competitive Analysis of Randomized Caching::::::::::::::::::: 35 Ching Law and Charles E. Leiserson (MIT Laboratory for Computer Science) Online Routing in Convex Subdivisions ::::::::::::::::::::::::::::::: 47 Prosenjit Bose, Pat Morin (Carleton University), Andrej Brodnik (University of Ljubljana), Svante Carlsson (University of Karlskona/Ronneby),ErikD.Demaine,RudolfFleischer,J.IanMunro (University of Waterloo), and Alejandro Lo(cid:19)pez-Ortiz (University of New Brunswick) Combinatorial Optimization A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors::::::::::::::::::::::::::::::::::::::: 60 Jingui Huang, Jianer Chen, and Songqiao Chen (Central-South University) Classi(cid:12)cation of Various Neighborhood Operations for the Nurse Scheduling Problem :::::::::::::::::::::::::::::::::::::::::::::::: 72 Takayuki Osogami (IBM Research) and Hiroshi Imai (University of Tokyo) X Table of Contents Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets :::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 84 Yuyu Chen, Ming-Yang Kao (Yale University), and Hsueh-I. Lu (Academia Sinica) Algorithms and Data Structures (II) Coping with Delays and Time-Outs in Binary Search Procedures :::::::: 96 Ferdinando Cicalese and Ugo Vaccaro (Universita(cid:18) di Salerno) Some Formal Analysis of Rocchio’s Similarity-Based Relevance Feedback Algorithm::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 108 Zhixiang Chen (University of Texas-Pan American) and Binhai Zhu (Montana State University) Reasoning with Ordered Binary Decision Diagrams ::::::::::::::::::: 120 Takashi Horiyama (Nara Institute of Science and Technology) and Toshihide Ibaraki (Kyoto University) Approximation and Randomized Algorithms (I) On Approximating Minimum Vertex Cover for Graphs with Perfect Matching ::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 132 Jianer Chen and Iyad A. Kanj (Texas A&M University) A 2-Approximation Algorithm for Path Coloring on Trees of Rings ::::::: 144 Xiaotie Deng, Yi Zhou (City University of Hong Kong), Guojun Li (Shandong University), and Wenan Zang (The University of Hong Kong) An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree :::::::::::::::::::::::::::::::::::::: 156 Q. S. Wu (National Tsing-Hua University), C. L. Lu (National Center for High-Performance Computing), and R. C. T. Lee (National Chi-Nan University) Algorithms and Data Structures (III) Finding Independent Spanning Trees in Partial k-Trees ::::::::::::::::: 168 Xiao Zhou and Takao Nishizeki (Tohoku University) On E(cid:14)cient Fixed Parameter Algorithms for Weighted Vertex Cover ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 180 Rolf Niedermeier (Universita¨t Tu¨bingen) and Peter Rossmanith (Technische Universita¨t Mu¨nchen) Table of Contents XI Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width :::::::::::::::::::::::::::::::::::::::::::::::::::: 192 Dimitros M. Thilikos, Maria J. Serna (Universitat Polit(cid:18)ecnica de Catalun ya), and Hans L. Bodlaender (Utrecht University) Approximation and Randomized Algorithms (II) Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits::::::::::::::::::::::::::::::::::: 204 Takao Asano (Chuo University), Magnu(cid:19)s M. Halldo(cid:19)rsson (University of Iceland), Kazuo Iwama (Kyoto University), and Takeshi Matsuda (Kyoto University) A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane::::::::::::::::::::::::::::::::::::::::::::::: 216 Norihiro Kubo, Shinichi Shimozono (Kyushu Inst. of Tech.), and Katsuhiro Muramoto (Iwashita Engineering Inc.) Simple Algorithms for a Weighted Interval Selection Problem:::::::::::: 228 Thomas Erlebach (Computer Engineering and Networks Laboratory, ETH Zu¨rich) and Frits C. R. Spieksma (Maastricht University) Graph Drawing and Algorithms E(cid:14)cient Minus and Signed Domination in Graphs:::::::::::::::::::::: 241 Chin L. Lu (National Center for High-Performance Computing), Sheng-Lung Peng (National Dong Hwa University), and Chuan Y. Tang (National Tsing Hua University) Convex Grid Drawings of Four-Connected Plane Graphs :::::::::::::::: 254 Kazuyuki Miura, Takao Nishizeki (Tohoku University), and Shin-ichi Nakano (Gunma University) AnAlgorithmforFindingThree-DimensionalSymmetryinSeries-Parallel Digraphs:::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 266 Seok-Hee Hong and Peter Eades (University of Sydney) Automata, Cryptography, and Complexity Theory Undecidability Results for Monoids with Linear-Time Decidable Word Problems ::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 278 Masashi Katsura (Kyoto-Sangyo University), Yuji Kobayashi (Toho University), and Friedrich Otto (Universita¨t Kassel) Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures :::::::::::::::::::::::::::::::::::::::::::::::::::::::: 290 Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, and Yoshihide Igarashi (Gunma University)
The list of books you might like
