國立虎尾科技大學 |

Approximation and online algorithms = 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016 : revised selected papers /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Approximation and online algorithms/ edited by Klaus Jansen, Monaldo Mastrolilli.
Reminder of title:	14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016 : revised selected papers /
remainder title:	WAOA 2016
other author:	Jansen, Klaus.
corporate name:	Workshop on the Preservation of Stability under Discretization
Published:	Cham :Springer International Publishing : : 2017.,
Description:	xiv, 211 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
Subject:	Online algorithms - Congresses. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-51741-4
ISBN:	9783319517414

Approximation and online algorithms = 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016 : revised selected papers /
Approximation and online algorithms14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016 : revised selected papers /[electronic resource] :WAOA 2016edited by Klaus Jansen, Monaldo Mastrolilli. - Cham :Springer International Publishing :2017. - xiv, 211 p. :ill., digital ;24 cm. - Lecture notes in computer science,101380302-9743 ;. - Lecture notes in computer science ;6140..

Approximation Algorithms for the k-Set Packing Problem -- On Linear and Semidefinite Programs for Polytopes in Combinatorial Optimization -- The Shortest Separating Cycle Problem -- Dynamic Traveling Repair Problem with an Arbitrary Time Window -- A PTAS for the Cluster Editing Problem on Planar Graphs -- Bin Packing with Colocations -- Batch Coloring of Graphs -- New Integrality Gap Results for the Firefighters Problem on Trees -- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs -- Balanced Optimization with Vector Costs -- Vertex Sparsification in Trees -- Scenario Submodular Cover -- Non-Greedy Online Steiner Trees on Outerplanar Graphs -- A Refined Analysis of Online Path Coloring in Trees -- Resource Allocation Games with Multiple Resource Classes -- Tight Approximation Bounds for the Seminar Assignment Problem -- A Priori TSP in the Scenario Model -- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems.

This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016. The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: 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: 9783319517414

Standard No.: 10.1007/978-3-319-51741-4doiSubjects--Topical Terms:

674690
Online algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and online algorithms = 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016 : revised selected papers /
LDR:02765nam a2200337 a 4500 001 958263
003 DE-He213
005 20170803154836.0
006 m d
007 cr nn 008maaau
008 201118s2017 gw s 0 eng d
020 $a 9783319517414 $q (electronic bk.)
020 $a 9783319517407 $q (paper)
024 7 $a 10.1007/978-3-319-51741-4 $2 doi
035 $a 978-3-319-51741-4
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 2016
111 2 $a Workshop on the Preservation of Stability under Discretization $d (2001 : $c Fort Collins, Colo.) $3 527686
245 1 0 $a Approximation and online algorithms $h [electronic resource] : $b 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016 : revised selected papers / $c edited by Klaus Jansen, Monaldo Mastrolilli.
246 3 $a WAOA 2016
260 $a Cham : $c 2017. $b Springer International Publishing : $b Imprint: Springer,
300 $a xiv, 211 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10138
505 0 $a Approximation Algorithms for the k-Set Packing Problem -- On Linear and Semidefinite Programs for Polytopes in Combinatorial Optimization -- The Shortest Separating Cycle Problem -- Dynamic Traveling Repair Problem with an Arbitrary Time Window -- A PTAS for the Cluster Editing Problem on Planar Graphs -- Bin Packing with Colocations -- Batch Coloring of Graphs -- New Integrality Gap Results for the Firefighters Problem on Trees -- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs -- Balanced Optimization with Vector Costs -- Vertex Sparsification in Trees -- Scenario Submodular Cover -- Non-Greedy Online Steiner Trees on Outerplanar Graphs -- A Refined Analysis of Online Path Coloring in Trees -- Resource Allocation Games with Multiple Resource Classes -- Tight Approximation Bounds for the Seminar Assignment Problem -- A Priori TSP in the Scenario Model -- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems.
520 $a This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016. The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: 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 674690 $3 733604
650 0 $a Approximation algorithms $v Congresses. $3 784360
650 1 4 $a Computer Science. $3 593922
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Algorithms. $3 527865
650 2 4 $a Numeric Computing. $3 669943
700 1 $a Jansen, Klaus. $3 783999
700 1 $a Mastrolilli, Monaldo. $3 1250324
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 6140. $3 744199
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-51741-4
950 $a Computer Science (Springer-11645)