• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History
  • ورود / ثبت نام

عنوان
Approximation and online algorithms :

پدید آورنده
WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012 ; Thomas Erlebach [und weitere] (eds.).

موضوع
Approximation,Approximationsalgorithmus,Online-Algorithmus

رده

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
3642380158
(Number (ISBN
3642380166
(Number (ISBN
9783642380150
(Number (ISBN
9783642380167

NATIONAL BIBLIOGRAPHY NUMBER

Number
b567944

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Approximation and online algorithms :
General Material Designation
[Book]
Other Title Information
10th International Workshop : revised selected papers
First Statement of Responsibility
WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012 ; Thomas Erlebach [und weitere] (eds.).

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
Heidelberg
Name of Publisher, Distributor, etc.
Springer
Date of Publication, Distribution, etc.
2013

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
297 Seiten : Illustrationen.

SERIES

Series Title
Lecture notes in computer science, 7846

CONTENTS NOTE

Text of Note
Invited Contribution.- The Primal-Dual Approach for Online Algorithms.- Session 1: Graphs and Networks.- Independent Set with Advice: The Impact of Graph Knowledge.- Online Multi-Commodity Flow with High Demands.- Approximating Spanning Trees with Few Branches .- On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters.- Session 2: Geometric Problems.- Online Exploration of Polygons with Holes.- Probabilistic k-Median Clustering in Data Streams.- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs.- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods.- Session 3: Online Algorithms.- Asymptotically Optimal Online Page Migration on Three Points.- R-LINE: A Better Randomized 2-Server Algorithm on the Line.- Black and White Bin Packing.- Minimizing Cache Usage in Paging.- Session 4: Scheduling.Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems.- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling.- Approximating the Throughput by Coolest First Scheduling.- Algorithms for Cost-Aware Scheduling.- Session 5: Algorithmic Game Theory.- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games.- Some Anomalies of Farsighted Strategic Behavior.- Session 6: Approximation Algorithms Scheduling with an Orthogonal Resource Constraint.- Improved Approximation Guarantees for Lower-Bounded Facility Location.- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs.- Approximation Algorithms for the Wafer to Wafer Integration Problem.

TOPICAL NAME USED AS SUBJECT

Approximation
Approximationsalgorithmus
Online-Algorithmus

PERSONAL NAME - PRIMARY RESPONSIBILITY

WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012 ; Thomas Erlebach [und weitere] (eds.).

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

Thomas Erlebach, Informatiker

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival