عنوان

Approximation and online algorithms :

شابک

3030046931

شابک

9783030046934

شابک اشتباه

3030046923

شابک اشتباه

9783030046927

عنوان اصلي

Approximation and online algorithms :

نام عام مواد

[Book]

ساير اطلاعات عنواني

16th international workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, revised selected papers /

نام نخستين پديدآور

Leah Epstein, Thomas Erlebach (eds.).

محل نشرو پخش و غیره

Cham, Switzerland :

نام ناشر، پخش کننده و غيره

Springer,

تاریخ نشرو بخش و غیره

c[2018]

نام خاص و کميت اثر

1 online resource

عنوان فروست

Lecture notes in computer science ;

عنوان فروست

LNCS sublibrary. SL 1, Theoretical computer science and general issues

مشخصه جلد

11312

متن يادداشت

Includes author index.

متن يادداشت

Includes bibliographical references and author index.

متن يادداشت

Some Easy and Some Not So Easy Geometric Optimization Problems -- Deterministic Min-Cost Matching with Delays -- Sequential Metric Dimension -- A Primal-Dual Online Deterministic Algorithm for Matching with Delays -- Advice Complexity of Priority Algorithms -- Approximating Node-Weighted k-MST on Planar Graphs -- Exploring Sparse Graphs with Advice -- Call Admission Problems on Grids with Advice -- Improved Approximation Algorithms for Minimum Power Covering Problems -- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals -- Strategic Contention Resolution in Multiple Channels -- Sublinear Graph Augmentation for Fast Query Implementation -- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy -- Probabilistic Embeddings of the Fréchet Distance -- Algorithms for Dynamic NFV Workload -- Longest Increasing Subsequence under Persistent Comparison Errors -- Cut Sparsifiers for Balanced Digraphs -- Reconfiguration of Graphs with Connectivity Constraints -- The Itinerant List Update Problem -- The Price of Fixed Assignments in Stochastic Extensible Bin Packing.

بدون عنوان

0

متن يادداشت

This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

منبع سفارش / آدرس اشتراک

Springer Nature

شماره انبار

com.springer.onix.9783030046934

عنوان

Approximation and online algorithms.

شماره استاندارد بين المللي کتاب و موسيقي

9783030046927

عنوان اصلي به زبان ديگر

WAOA 2018

موضوع مستند نشده

Approximation algorithms, Congresses.

موضوع مستند نشده

Online algorithms, Congresses.

موضوع مستند نشده

Approximation algorithms.

موضوع مستند نشده

Online algorithms.

موضوع مستند نشده

COM051300

موضوع مستند نشده

UMB

موضوع مستند نشده

UMB

شماره

ويراست

شماره رده

نشانه اثر

مستند نام اشخاص تاييد نشده

Epstein, Leah.

مستند نام اشخاص تاييد نشده

Erlebach, Thomas.

مستند نام تنالگان تاييد نشده

WAOA (Workshop)(16th :2018 :, Helsinki, Finland)

تاريخ عمليات

20200823080823.0

قواعد فهرست نويسي ( بخش توصيفي )

pn

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y