國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Approximation and online algorithms1...

(1998 :)

Approximation and online algorithms14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016 : revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Approximation and online algorithmsedited by Klaus Jansen, Monaldo Mastrolilli.
其他題名:	14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016 : revised selected papers /
其他題名:	WAOA 2016
其他作者:	Jansen, Klaus.
團體作者:
出版者:	Cham :Springer International Publishing :2017.
面頁冊數:	xiv, 211 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Online algorithmsCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-51741-4
ISBN:	9783319517414$q(electronic bk.)

Approximation and online algorithms14th 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 ;4891..

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$q(electronic bk.)

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

442929
Online algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and online algorithms14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016 : revised selected papers /
LDR:02765nmm a2200337 a 4500 001 506684
003 DE-He213
005 20170803154836.0
006 m d
007 cr nn 008maaau
008 171030s2017 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 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
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 442929
650 0 $a Approximation algorithms $v Congresses. $3 510892
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Numeric Computing. $3 275524
700 1 $a Jansen, Klaus. $3 279052
700 1 $a Mastrolilli, Monaldo. $3 772852
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-51741-4
950 $a Computer Science (Springer-11645)