東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Approximation and online algorithms ...

Bampis, Evripidis.

Linked to FindBook

Google Book

Amazon

博客來

Approximation and online algorithms = 12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014 : revised selected papers /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Approximation and online algorithms/ edited by Evripidis Bampis, Ola Svensson.
Reminder of title:	12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014 : revised selected papers /
remainder title:	WAOA 2014
other author:	Bampis, Evripidis.
Published:	Cham :Springer International Publishing : : 2015.,
Description:	x, 273 p. :ill., digital ;24 cm.
[NT 15003449]:	Improved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems.
Contained By:	Springer eBooks
Subject:	Online algorithms - Congresses. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-18263-6
ISBN:	9783319182636 (electronic bk.)

Approximation and online algorithms = 12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014 : revised selected papers /
Approximation and online algorithms12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014 : revised selected papers /[electronic resource] :WAOA 2014edited by Evripidis Bampis, Ola Svensson. - Cham :Springer International Publishing :2015. - x, 273 p. :ill., digital ;24 cm. - Lecture notes in computer science,89520302-9743 ;. - Lecture notes in computer science ;5353..

Improved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems.

This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wroclaw, Poland, in September 2014 as part of ALGO 2014. The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.

ISBN: 9783319182636 (electronic bk.)

Standard No.: 10.1007/978-3-319-18263-6doiSubjects--Topical Terms:

1569029
Online algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and online algorithms = 12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014 : revised selected papers /
LDR:03084nmm m2200337 m 4500 001 2001622
003 DE-He213
005 20151113110302.0
006 m d
007 cr nn 008maaau
008 151215s2015 gw s 0 eng d
020 $a 9783319182636 (electronic bk.)
020 $a 9783319182629 (paper)
024 7 $a 10.1007/978-3-319-18263-6 $2 doi
035 $a 978-3-319-18263-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W251 2014
245 1 0 $a Approximation and online algorithms $h [electronic resource] : $b 12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014 : revised selected papers / $c edited by Evripidis Bampis, Ola Svensson.
246 3 $a WAOA 2014
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a x, 273 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 8952
505 0 $a Improved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems.
520 $a This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wroclaw, Poland, in September 2014 as part of ALGO 2014. The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.
650 0 $a Online algorithms $v Congresses. $3 1569029
650 0 $a Approximation algorithms $v Congresses. $3 1532429
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Numeric Computing. $3 892606
650 2 4 $a Algorithms. $3 536374
700 1 $a Bampis, Evripidis. $3 1002162
700 1 $a Svensson, Ola. $3 2145396
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 5353. $x 0302-9743 $3 1274248
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-18263-6
950 $a Computer Science (Springer-11645)