ALGORITHM_THEORY___PENTTONE.PDF

(6997 KB) Pobierz
Springer LINK: Lecture Notes in Computer Science
M. Penttonen, E. Meineche Schmidt (Eds.):
Algorithm Theory - SWAT 2002
8th Scandinavian Workshop on Algorithm Theory, Turku,
Finland, July 3-5, 2002. Proceedings
LNCS 2368
Ordering Information
Table of Contents
Title pages in PDF (9 KB)
In Memory of Timo Raita in PDF (14 KB)
Preface in PDF (15 KB)
Organization in PDF (20 KB)
Table of Contents in PDF (45 KB)
Invited Speakers
An Efficient Quasidictionary
Torben Hagerup and Rajeev Raman
LNCS 2368, p. 1 ff.
Abstract
|
Full article in PDF (217 KB)
http://buffy.lib.unimelb.edu.au:2150/link/service/series/0558/tocs/t2368.htm (1 of 7) [9/30/2002 10:21:43 PM]
Springer LINK: Lecture Notes in Computer Science
Combining Pattern Discovery and Probabilistic Modeling in Data Mining
Heikki Mannila
LNCS 2368, p. 19
Abstract
|
Full article in PDF (33 KB)
Scheduling
Time and Space Efficient Multi-method Dispatching
Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, and Theis Rauhe
LNCS 2368, p. 20 ff.
Abstract
|
Full article in PDF (160 KB)
Linear Time Approximation Schemes for Vehicle Scheduling
John E. Augustine and Steven S. Seiden
LNCS 2368, p. 30 ff.
Abstract
|
Full article in PDF (160 KB)
Minimizing Makespan for the Lazy Bureaucrat Problem
Clint Hepner and Cliff Stein
LNCS 2368, p. 40 ff.
Abstract
|
Full article in PDF (149 KB)
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times
Monaldo Mastrolilli
LNCS 2368, p. 51 ff.
Abstract
|
Full article in PDF (154 KB)
Computational Geometry
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in
Polygons and Terrains
Stephan Eidenbenz
LNCS 2368, p. 60 ff.
Abstract
|
Full article in PDF (138 KB)
Simplex Range Searching and Nearest Neighbors of a Line Segment in 2D
Partha P. Goswami, Sandip Das, and Subhas C. Nandy
LNCS 2368, p. 69 ff.
Abstract
|
Full article in PDF (208 KB)
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal
Chains
Christos Levcopoulos, Andrzej Lingas, and Joseph S.B. Mitchell
LNCS 2368, p. 80 ff.
Abstract
|
Full article in PDF (149 KB)
http://buffy.lib.unimelb.edu.au:2150/link/service/series/0558/tocs/t2368.htm (2 of 7) [9/30/2002 10:21:43 PM]
Springer LINK: Lecture Notes in Computer Science
Exact Algorithms and Approximation Schemes for Base Station Placement Problems
Nissan Lev-Tov and David Peleg
LNCS 2368, p. 90 ff.
Abstract
|
Full article in PDF (174 KB)
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels
Zhongping Qin and Binhai Zhu
LNCS 2368, p. 100 ff.
Abstract
|
Full article in PDF (153 KB)
Optimal Algorithm for a Special Point-Labeling Problem
Sasanka Roy, Partha P. Goswami, Sandip Das, and Subhas C. Nandy
LNCS 2368, p. 110 ff.
Abstract
|
Full article in PDF (171 KB)
Random Arc Allocation and Applications
Peter Sanders and Berthold Vöcking
LNCS 2368, p. 121 ff.
Abstract
|
Full article in PDF (159 KB)
On Neighbors in Geometric Permutations
Micha Sharir and Shakhar Smorodinsky
LNCS 2368, p. 131 ff.
Abstract
|
Full article in PDF (152 KB)
Graph Algorithms
Powers of Geometric Intersection Graphs and Dispersion Algorithms
Geir Agnarsson, Peter Damaschke, and Magnús M. Halldórsson
LNCS 2368, p. 140 ff.
Abstract
|
Full article in PDF (179 KB)
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the
Planar Case
Jochen Alber, Michael R. Fellows, and Rolf Niedermeier
LNCS 2368, p. 150 ff.
Abstract
|
Full article in PDF (242 KB)
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous
Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, and Gerhard J. Woeginger
LNCS 2368, p. 160 ff.
Abstract
|
Full article in PDF (158 KB)
Approximation Hardness of the Steiner Tree Problem on Graphs
Miroslav Chlebík and Janka Chlebíková
LNCS 2368, p. 170 ff.
Abstract
|
Full article in PDF (146 KB)
http://buffy.lib.unimelb.edu.au:2150/link/service/series/0558/tocs/t2368.htm (3 of 7) [9/30/2002 10:21:43 PM]
Springer LINK: Lecture Notes in Computer Science
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus
J. Ellis, H. Fan, and Michael R. Fellows
LNCS 2368, p. 180 ff.
Abstract
|
Full article in PDF (175 KB)
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type
Approximation Algorithms
Harold N. Gabow and Seth Pettie
LNCS 2368, p. 190 ff.
Abstract
|
Full article in PDF (131 KB)
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
Alexander Golynski and Joseph D. Horton
LNCS 2368, p. 200 ff.
Abstract
|
Full article in PDF (160 KB)
Approximation Algorithms for Edge-Dilation -Center Problems
Jochen Könemann, Yanjun Li, Ojas Parekh, and Amitabh Sinha
LNCS 2368, p. 210 ff.
Abstract
|
Full article in PDF (176 KB)
Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a
Static Clustering Algorithm
Sarnath Ramnath
LNCS 2368, p. 220 ff.
Abstract
|
Full article in PDF (137 KB)
Improved Algorithms for the Random Cluster Graph Model
Ron Shamir and Dekel Tsur
LNCS 2368, p. 230 ff.
Abstract
|
Full article in PDF (187 KB)
-List Vertex Coloring in Linear Time
San Skulrattanakulchai
LNCS 2368, p. 240 ff.
Abstract
|
Full article in PDF (145 KB)
Robotics
Robot Localization without Depth Perception
Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro
LNCS 2368, p. 249 ff.
Abstract
|
Full article in PDF (189 KB)
Online Parallel Heuristics and Robot Searching under the Competitive Framework
Alejandro López-Ortiz and Sven Schuierer
http://buffy.lib.unimelb.edu.au:2150/link/service/series/0558/tocs/t2368.htm (4 of 7) [9/30/2002 10:21:43 PM]
Springer LINK: Lecture Notes in Computer Science
LNCS 2368, p. 260 ff.
Abstract
|
Full article in PDF (159 KB)
Analysis of Heuristics for the Freeze-Tag Problem
Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, and Joseph S.B. Mitchell
LNCS 2368, p. 270 ff.
Abstract
|
Full article in PDF (175 KB)
Approximation Algorithms
Approximations for Maximum Transportation Problem with Permutable Supply Vector
and Other Capacitated Star Packing Problems
Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, and Maxim Sviridenko
LNCS 2368, p. 280 ff.
Abstract
|
Full article in PDF (150 KB)
All-Norm Approximation Algorithms
Yossi Azar, Leah Epstein, Yossi Richter, and Gerhard J. Woeginger
LNCS 2368, p. 288 ff.
Abstract
|
Full article in PDF (147 KB)
Approximability of Dense Instances of NEAREST CODEWORD Problem
Cristina Bazgan, W. Fernandez de la Vega, and Marek Karpinski
LNCS 2368, p. 298 ff.
Abstract
|
Full article in PDF (152 KB)
Data Communication
Call Control with Rejections
R. Sai Anand, Thomas Erlebach, Alexander Hall, and Stamatis Stefanakos
LNCS 2368, p. 308 ff.
Abstract
|
Full article in PDF (95 KB)
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
Guy Even, Guy Kortsarz, and Wolfgang Slany
LNCS 2368, p. 318 ff.
Abstract
|
Full article in PDF (164 KB)
Packet Bundling
Jens S. Frederiksen and Kim S. Larsen
LNCS 2368, p. 328 ff.
Abstract
|
Full article in PDF (148 KB)
Algorithms for the Multi-constrained Routing Problem
Anuj Puri and Stavros Tripakis
LNCS 2368, p. 338 ff.
http://buffy.lib.unimelb.edu.au:2150/link/service/series/0558/tocs/t2368.htm (5 of 7) [9/30/2002 10:21:43 PM]

Plik z chomika:

Inne pliki z tego folderu:

Inne foldery tego chomika:

Zgłoś jeśli naruszono regulamin