東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Combinatorial algorithms = 31st Inte...

International Workshop on Combinatorial Algorithms (2020 :)

FindBook

Google Book

Amazon

博客來

Combinatorial algorithms = 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorial algorithms/ edited by Leszek Gasieniec, Ralf Klasing, Tomasz Radzik.
其他題名:	31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020 : proceedings /
其他題名:	IWOCA 2020
其他作者:	Gasieniec, Leszek.
團體作者:	International Workshop on Combinatorial Algorithms
出版者:	Cham :Springer International Publishing : : 2020.,
面頁冊數:	xix, 424 p. :ill., digital ;24 cm.
內容註:	Coordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,')-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs.
Contained By:	Springer eBooks
標題:	Combinatorial analysis - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-48966-3
ISBN:	9783030489663

Combinatorial algorithms = 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020 : proceedings /
Combinatorial algorithms31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020 : proceedings /[electronic resource] :IWOCA 2020edited by Leszek Gasieniec, Ralf Klasing, Tomasz Radzik. - Cham :Springer International Publishing :2020. - xix, 424 p. :ill., digital ;24 cm. - Lecture notes in computer science,121260302-9743 ;. - Lecture notes in computer science ;12126..

Coordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,')-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs.

This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8-10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.

ISBN: 9783030489663

Standard No.: 10.1007/978-3-030-48966-3doiSubjects--Topical Terms:

607039
Combinatorial analysis
--Congresses.

LC Class. No.: QA164 / .I58 2020

Dewey Class. No.: 004.0151

Combinatorial algorithms = 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020 : proceedings /
LDR:03559nmm a2200373 a 4500 001 2255030
003 DE-He213
005 20200529190908.0
006 m d
007 cr nn 008maaau
008 220419s2020 sz s 0 eng d
020 $a 9783030489663 $q (electronic bk.)
020 $a 9783030489656 $q (paper)
024 7 $a 10.1007/978-3-030-48966-3 $2 doi
035 $a 978-3-030-48966-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164 $b .I58 2020
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA164 $b .I61 2020
111 2 $a International Workshop on Combinatorial Algorithms $n (31st : $d 2020 : $c Online) $3 3524352
245 1 0 $a Combinatorial algorithms $h [electronic resource] : $b 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020 : proceedings / $c edited by Leszek Gasieniec, Ralf Klasing, Tomasz Radzik.
246 3 $a IWOCA 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xix, 424 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12126
490 1 $a Theoretical computer science and general issues
505 0 $a Coordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,')-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs.
520 $a This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8-10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.
650 0 $a Combinatorial analysis $v Congresses. $3 607039
650 0 $a Algorithms $v Congresses. $3 607038
650 1 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Information Systems Applications (incl. Internet) $3 1565452
650 2 4 $a Computer Communication Networks. $3 775497
650 2 4 $a Computer Graphics. $3 892532
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
700 1 $a Gasieniec, Leszek. $3 3521835
700 1 $a Klasing, Ralf. $3 1619348
700 1 $a Radzik, Tomasz. $3 1004621
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 12126. $3 3524353
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-48966-3
950 $a Computer Science (Springer-11645)