近似法、随机化与组合优化算法与技术：APPROX 2006与RANDOM 2006/会议录
点此进入淘宝搜索页搜索分类: 图书,计算机/网络,计算机理论,
作者： Josep Diaz 著
出 版 社： 湖北辞书出版社
出版时间： 2006-12-1字数：版次： 1页数： 519印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540380443包装： 平装编辑推荐
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 joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006, held in Barcelona, Spain, in August 2006.
The 44 revised full papers presented were carefully reviewed and selected from 105 submissions. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, game theory, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness, derandomization, random combinatorial structures, Markov chains, prohabalistic proof systems, error-correcting codes, etc.
目录
Invited Talks
On Nontrivial Approximation of CSPs
Analysis of Algorithms on the Cores of Random Graphs
Conrtibured Talks of APPROX
Constant-Factor Approximation for Minimum-Weight(Connected) Dominating Sets in unit Disk Graphs
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Minimizing Setup and Beam-On Times in Radiation Therapy
On the Valur of Preemption in Scheduling
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
Tight Resrlts on Minimum Entropy Set Cover
A Tight Lower Bound for the Steiner Point Removal Prlblem on Trees
Single-Source Stochastic Routing
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
Online Algorithms to Minimize Resource Reallocations and Network Communication
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Combinatorial Algorithms for Data to Minimize Average Completion Time
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
Improved Algorithms for Data Migration
Approximation Algorithms for Graph Homomorphism Problems
Improved Approximation Algorithm for the One-Warehouse
Hardmess of Preemptive Finite Capacity Dial-a-Ride
Minimum Vehicle Routing with a Common Deadline
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
……
Contributed Talks of RANDOM
Author Index
