网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 教育/科技 > 科学与研究 > 商品详情

逼近与联机算法/会议录 Approximation and Online Algorithms

分享到:
逼近与联机算法/会议录 Approximation and Online Algorithms

最 低 价:¥406.80

定 价:¥542.40

作 者:GiuseppePersiano , RobertoSolis-Oba 著

出 版 社:北京燕山出版社

出版时间:2005-3-1

I S B N:9783540245742

商品详情

编辑推荐

内容简介

This book constitutes the thoroughly refereed post proceedings of the Second International Workshop on Approximation and Online Algorithms, WAOA 2004, held in Bergen, Norway in September 2004.
The 21 revised full papers presented together with 2 invited papers were carefully selected during two rounds of reviewing and improvement from 47 submissions. WAOA is devoted to the design and analysis of algorithms for online and computationally hard problems. Among the topics addressed are applications to game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric computations, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems.

作者简介

目录

Invited Talks
Online Packet Switching
Approximation Algorithms for Mixed Fractional Packing and Covering Problems
Regular Papers
Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees
Online Bin Packing with Resource Augmentation
A PTAS for Delay Minimization in Establishing Wireless Conference Calls
This Side Up!
Approximation Algorithm for Directed Multicuts
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria
Approximation Algorithms for Spreading Points
More Powerful and Simpler Cost-Sharing Methods
Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints
Priority Algorithms for Graph Optimization Problems
Pricing Network Edges to Cross a River
Submodular Integer Cover and Its Application to Production Planning
Stochastic Online Scheduling on Parallel Machines Tjark Vredeveld
A 5/4-Approximation Algorithm for Biconnecting a Graph with a
Given Hamiltonian Path
Ordering-Preserving Transformations and Greedy-Like Algorithms
Off-line Admission Control for Advance Reservations in Star Networks
Joint Base Station Scheduling
Universal Bufferless Routing
Strong Colorings of Hypergraphs
Deterministic Monotone Algorithms for Scheduling on Related Machines
Better Bounds for Minimizing SONET ADMs
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...