Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai, India, December 16–18, 1999 Proceedings

460 Pages·1999·2.53 MB·English

by  Alok Aggarwal

Lecture Notes in Computer Science 1741
EditedbyG.Goos,J.HartmanisandJ.vanLeeuwen
3
Berlin
Heidelberg
NewYork
Barcelona
HongKong
London
Milan
Paris
Singapore
Tokyo
Alok Aggarwal C. Pandu Rangan (Eds.)
Algorithms
and Computation
10th International Symposium, ISAAC’99
Chennai, India, December 16-18, 1999
Proceedings
1 3
SeriesEditors
GerhardGoos,KarlsruheUniversity,Germany
JurisHartmanis,CornellUniversity,NY,USA
JanvanLeeuwen,UtrechtUniversity,TheNetherlands
VolumeEditors
AlokAggarwal
IBM,SolutionsResearchCenter,Block1
IndianInstituteofTechnology
NewDelhi,110016,India
E-mail:[email protected]
C.PanduRangan
DepartmentofComputerScienceandEngineering
IndianInstituteofTechnology
Madras,Chennai–600036,India
E-mail:[email protected]
Cataloging-in-Publicationdataappliedfor
DieDeutscheBibliothek-CIP-Einheitsaufnahme
Algorithmsandcomputation:10thinternationalsymposium;proceedings/ISAAC
’99,Chennai,India,December16-18,1999.AlokAggarwal;C.PanduRangan
(ed.).-Berlin;Heidelberg;NewYork;Barcelona;HongKong;London;
Milan;Paris;Singapore;Tokyo:Springer,1999
(Lecturenotesincomputerscience;Vol.1741)
ISBN3-540-66916-7
CRSubjectClassification(1998):F.2,F.1,C.2,G.2-3,I.3.5,E.1
ISSN0302-9743
ISBN3-540-66916-7Springer-VerlagBerlinHeidelbergNewYork
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer-Verlag.Violationsare
liableforprosecutionundertheGermanCopyrightLaw.
©Springer-VerlagBerlinHeidelberg1999
PrintedinGermany
Typesetting:Camera-readybyauthor
SPIN:10749965 06/3142–543210 Printedonacid-freepaper
Preface
This volume contains the proceedings of the 10th ISAAC conference (Tenth An-
nual International Symposium on Algorithms And Computation) held in Chen-
nai, India. This year’s conference attracted 71 submissions from as many as 17
di(cid:11)erent countries. Each submission was reviewed by at least three independent
referees. After a week-long e-mail discussion, the program committee agreed to
include40papersintheconferenceprogram.Thehighacceptancerateisclearly
an indication of the quality of the papers received. We thank the program com-
mittee members and the reviewers for their sincere e(cid:11)orts.
We were fortunate to have three invited speakers this year, providing for a
very attractive program: Kurt Mehlhorn (MPI, Saarbru¨cken, Germany), Eva Tar-
dos (Cornell University, U.S.A.), and Kokichi Sugihara (Univ. of Tokyo, Japan).
Moreover, the conference was preceded by a tutorial on a cutting-edge area,
Web Algorithmics by Monika Henzinger (Compaq Systems Research Center, Palo
Alto, U.S.A.) as a joint event with FST&TCS 99 (Foundations of Software Tech-
nology and Theoretical Computer Science, December 13-15, 1999, Chennai). As a
post conference event, a two-day workshop on Approximate Algorithms by R.Ravi
(CMU,U.S.A.)andNaveenGarg(IIT,Delhi)wasorganized.Wethankalltheinvi-
tedspeakersandspecialeventspeakersforagreeingtoparticipateinISAAC’99.
This year is a special year for the organizing institute Indian Institute of
Technology, Madras and for the Computer Science and Engineering department
at IIT, Madras; IIT is celebrating its 40th anniversary and it is the Silver Ju-
bilee year for the CSE department. The CSE department at IIT is proud to
host this prestigious conference and the allied events. We thank the Director
of IIT, Madras, Prof. R. Natarajan, for making available the facilities of the
institute for ISAAC related events. Several private companies and educational
trusts came forward to extend (cid:12)nancial support for ISAAC’99. The generous
support from IBM Solutions Research Centre, New Delhi, Jeppiar Educational
Trust, Chennai, Jaya Educational Trust, Chennai, Philips Software Centre Pvt.
Ltd,Bangalore,DigitalandAnalogComputingServices(DACS),Bangaloreare
greatfullyacknowledged.TheIITMadrasAlumniAssociationinNorthAmerica
has contributed towards subsidized stay and travel expenses for several Indian
participants, enabling them to attend ISAAC’99. We thank the members of or-
ganizing committee for making it happen. Special thanks go to the sta(cid:11) of our
InstituteandtoAlfredHo(cid:11)manofSpringer-Verlagforhelpwiththeproceedings.
October 1999 Alok Aggarwal
C. Pandu Rangan
VI Preface
Tenth Annual International Symposium on
Algorithms And Computation
ISAAC’99
December 16-18, 1999, Chennai, India
Symposium Chair
(cid:15) Pandu Rangan C (IIT, Madras)
Program Committee Co-chairs
(cid:15) Alok Aggarwal (IBM, India)
(cid:15) Pandu Rangan C (IIT, Madras)
Program Committee
(cid:15) Antonios Symvonis (U. Sydney, Australia)
(cid:15) Aravind Srinivasan (Bell Labs, U.S.A.)
(cid:15) Cai Mao-cheng (CAS, R.O.C.)
(cid:15) Hisao Tamaki (U. Meiji, Japan)
(cid:15) Jung-Heum Park (Catholic U. Korea, South Korea)
(cid:15) Lusheng Wang (City U. Hong Kong, R.O.C.)
(cid:15) Mark Keil (U. Saskatchewan, Canada)
(cid:15) Prabhakar Raghavan (IBM, U.S.A.)
(cid:15) Ramesh Kumar Sitaraman (U. Massachusetts, U.S.A.)
(cid:15) Seinosuke Toda (U. Nihon, Japan)
(cid:15) Tadao Takaoka (U. Canterbury, New Zealand)
(cid:15) Tak-wah Lam (U. Hong Kong, R.O.C.)
(cid:15) Wen-Lian Hsu (Academia Scinica, Taiwan, R.O.C.)
Alok Aggarwal (IBM, India)
Pandu Rangan C (IIT, Madras, India)
Organizing Committee
(cid:15) E. Boopal (IIT, Madras)
(cid:15) V. Kamakoti (ATI Research, Chennai)
(cid:15) R. Rama (IIT, Madras)
(cid:15) K. Rangarajan (MCC, Chennai)
Preface VII
Advisary Committee
(cid:15) Francis Chin (U. Hong Kong, R.O.C.)
(cid:15) Peter Eades (U. Newcastle, Australia)
(cid:15) Ding-Zhu Du (U. Minnesota, U.S.A.)
(cid:15) Wen-Lian Hsu (Academia Sinica, Taiwan)
(cid:15) Toshihide Ibaraki (U. Kyoto, Japan)
(cid:15) D.T. Lee (Academia Sinica, Taiwan, R.O.C.)
(cid:15) Takao Nishizeki (Tohoku U., Japan, Chair)
Sponsors
(cid:15) Indian Institute of Technology, Madras
(cid:15) IBM Solutions Research Center, New Delhi
(cid:15) Jeppiar Educational Trust, Chennai
(cid:15) Jaya Educational Trust, Thiruninravur
(cid:15) Philips Software Center Pvt. Ltd., Bangalore
(cid:15) Digital & Analog Computing Services (DACS), Bangalore
VIII Preface
List of Reviewers
Alexander Russell Kamesh Munagala S.A. Choudum
Alok Aggarwal Kasturi Varadarajan S. Arun Kumar
Antonios Symvonis K.G. Subramanian Seinosuke Toda
Aravind Srinivasan Kunsoo Park Soo-Hwan Kim
Cai Mao-Cheng K.V. Subrahmanyam S.S. Ravi
C. Pandu Rangan Kyubum Wee Stephen Hirst
Chan-Su Shin Lusheng Wang Sung Kwon Kim
Hee-Chul Kim Mahnhoon Lee T. Hasunuma
Hema A Murthy Mark Keil T. Tokuyama
Hisao Tamaki Moses Charikar Tadao Takaoka
Hwan Gue Cho Naveen Garg Tae-Cheon Yang
Hyeong-Seok Lim Peter Schachte Tak-Wah Lam
Igor Shparlinski Prabhakar Raghavan Te. Asano
Je(cid:11) Kingston P.S. Subramanian Trevor Dix
Jik Hyun Chang R. Uehara V.S. Subrahmanian
Jung-Heum Park Ramesh K. Sitaraman Wen-Lian Hsu
Kamala Krithivasan Richard Brent Y. Takenaga
Table of Contents
Invited Talk
The Engineering of Some Bipartite Matching Programs .....................1
Kurt Mehlhorn
Session 1(a) - Data Structure I
General Splay: A Basic Theory and Calculus ...............................4
G.F. Georgakopoulos, D.J. McClurkin
Static Dictionaries Supporting Rank ......................................18
Venkatesh Raman, S. Srinivasa Rao
Session 1(b) - Parallel & Distributed Computing I
Multiple Spin-Block Decisions .............................................27
Peter Damaschke
Asynchronous Random Polling Dynamic Load Balancing ..................37
Peter Sanders
Session 2(a) - Approximate Algorithm I
Simple Approximation Algorithms for MAXNAESP and Hypergraph
2-colarability ..............................................................49
Daya Ram Gaur, Ramesh Krishnamurti
Hardness of Approximating Independent Domination in Circle Graphs ....56
Mirela Damian-Iordache, Sriram V. Pemmaraju
Constant-Factor Approximation Algorithms for Domination Problems
on Circle Graphs ..........................................................70
Mirela Damian-Iordache, Sriram V. Pemmaraju
Session 2(b) - Computational Intelligence
Ordered Binary Decision Diagrams as Knowledge-Bases ...................83
Takashi Horiyama, Toshihide Ibaraki
Hard Tasks for Weak Robots: The Role of Common Knowledge in
Pattern Formation by Autonomous Mobile Robots ........................93
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
X Table of Contents
Session 3(a) - Online Algorithm
On-Line Load Balancing of Temporary Tasks Revisited ..................103
Kar-Keung To, Wai-Ha Wong
Online Routing in Triangulations ........................................113
Prosenjit Bose, Pat Morin
Session 3(b) - Complexity Theory I
The Query Complexity of Program Checking by Constant-Depth Circuits 123
V. Arvind, K.V. Subrahmanyam, N.V. Vinodchandran
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like
Resolution for the Pigeonhole Principle ..................................133
Kazuo Iwama, Shuichi Miyazaki
Session 4(a) - Approximate Algorithm II
E(cid:14)cient Approximation Algorithms for Multi-label Map Labeling ........143
Binhai Zhu, C.K. Poon
Approximation Algorithms in Batch Processing ..........................153
Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang
Session 4(b) - Graph Algorithm I
LexBFS-Ordering in Asteroidal Triple-Free Graphs .......................163
Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko
Parallel Algorithms for Shortest Paths and Related Problems
on Trapezoid Graphs ....................................................173
F.R. Hsu, Yaw-Ling Lin, Yin-Te Tsai
Invited Talk
ApproximationAlgorithmsforSomeClusteringandClassi(cid:12)cationProblems 183
Eva Tardos
Session 5(a) - Computational Geometry I
How Many People Can Hide in a Terrain? ................................184
Stephan Eidenbenz