算法理论－SWAT2002/会议录 Algorithm theory - SWAT 2002
点此进入淘宝搜索页搜索分类: 图书,计算机/网络,计算机理论,
作者： Martti Penttonen著
出 版 社： 湖南文艺出版社
出版时间： 2002-12-1字数：版次： 1页数： 450印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540438663包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research,development,and education,at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community,with numerous individuals,as well as with prestigious organizations and societies,LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.)
内容简介
This book constitutes the refereed proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, held in Turku, Finland, in July 2002.The 43 revised full papers presented together with two invited contributions were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections on scheduling, computational geometry, graph algorithms, robotics, approximation algorithms, data communication, computational biology, and data storage and manipulation.
目录
Invited Speakers
An Efficient Quasidictionary
Combining Pattern Discovery and Probabilistic Modeling in Data Mining
Scheduling
Time and Space Efficient Multi-method Dispatching
Linear Time Approximation Schemes for Vehicle Scheduling
Minimizing Makespan for the Lazy Bureaucrat Problem
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times
Computational Geometry
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains
Exact Algorithms and Approximation Schemes for Base Station Placement Problems
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels
Optimal Algorithm for a Special Point-Labeling Problem
Random Arc Allocation and Applications
On Neighbors in Geometric Permutations
Graph Algorithms
Powers of Geometric Intersection Graphs and Dispersion Algorithms
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous
Approximation Hardness of the Steiner Tree Problem on Graphs
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
Approximation Algorithms for Edge-Dilation k-Center Problems
Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm
……
Robotics
Approximation Algorithms
Data Communication
Computational Biology
Data Storage and Manipulation
Author Index
