國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Approximation and online algorithms1...

(1998 :)

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

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Approximation and online algorithmsedited by Evripidis Bampis, Ola Svensson.
其他題名:	12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014 : revised selected papers /
其他題名:	WAOA 2014
其他作者:	Bampis, Evripidis.
團體作者:
出版者:	Cham :Springer International Publishing :2015.
面頁冊數:	x, 273 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Online algorithmsCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-18263-6
ISBN:	9783319182636 (electronic bk.)

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

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:

442929
Online algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and online algorithms12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014 : revised selected papers /
LDR:03084nmm a2200337 a 4500 001 465572
003 DE-He213
005 20151113110302.0
006 m d
007 cr nn 008maaau
008 151222s2015 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
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 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 Numeric Computing. $3 275524
650 2 4 $a Algorithms. $3 184661
700 1 $a Bampis, Evripidis. $3 279051
700 1 $a Svensson, Ola. $3 719356
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-18263-6
950 $a Computer Science (Springer-11645)