ISBN: 3-540-66916-7
TITLE: Algorithms and Computations
AUTHOR: Aggarwal, Alok; Pandu Rangan, C. (Eds.)
TOC:

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
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
Efficient 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
Approximation Algorithms for Some Clustering and Classification Problems 183
Eva Tardos
Session 5(a) - Computational Geometry I
How Many People Can Hide in a Terrain? .184
Stephan Eidenbenz
Carrying Umbrellas: An Online Relocation Problem on Graphs .195
Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
Session 5(b) - Parallel & Distributed Computing II
Survivable Networks with Bounded Delay: The Edge Failure Case 205
Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks 215
J.L. Bordim, J. Cui, T. Hayashi, K. Nakano, S. Olariu
Session 6(a) - Data Structure II
Constructing the Suffix Tree of a Tree with a Large Alphabet 225
Tetsuo Shibuya
An O(1) Time Algorithm for Generating Multiset Permutations 237
Tadao Takaoka
Session 6(b) - Complexity Theory II
Upper Bounds for MaxSat: Further Improved 247
Nikhil Bansal, Venkatesh Raman
A Linear Time Algorithm for Recognizing Regular Boolean Functions 259
Kazuhisa Makino
Session 7(a) - Computational Geometry II
Station Layouts in the Presence of Location Constraints .269
Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg
Reverse Center Location Problem 279
Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai
Session 7(b) - Algorithms in Practice
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields 295
Abhijit Das, C.E. Veni Madhavan
External Memory Algorithms for Outerplanar Graphs 307
Anil Maheshwari, Norbert Zeh
Session 8(a) - Approximate Algorithm III
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree 317
Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
Approximation Algorithms for Channel Assignment with Constraints .327
Jeannette Janssen, Lata Narayanan
Session 8(b) - Graph Algorithm II
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs 337
Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki
A Linear Algorithm for Finding Total Colorings of Partial k-Trees 347
Shuji Isobe, Xiao Zhou, Takao Nishizeki
Invited Talk
Topology-Oriented Approach to Robust Geometric Computation 357
Kokichi Sugihara
Session 9(a) - Approximate Algorithm IV
Approximating Multicast Congestion .367
Santosh Vempala, Berthold Vcking
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts 373
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
Session 9(b) - Parallel & Distributed Computing III
Online Scheduling of Parallel Communications with Individual Deadlines 383
Jae-Ha Lee, Kyung-Yong Chwa
A Faster Algorithm for Finding Disjoint Paths in Grids 393
Wun-Tat Chan, Francis Y.L. Chin, Hing-Fung Ting
Session 10(a) - Computational Geometry III
Output-Sensitive Algorithms for Uniform Partitions of Points 403
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
Convexifying Monotone Polygons 415
Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss
Session 10(b) - Graph Algorithm III
Bisecting Two Subsets in 3-Connected Graphs 425
Hiroshi Nagamochi, Tibor Jordn, Yoshitaka Nakao, Toshihide Ibaraki
Generalized Maximum Independent Sets for Trees in Subquadratic Time 435
B.K. Bhattacharya, M.E. Houle
Author Index .447
END
