國立虎尾科技大學 |

Frontiers in Algorithmics = 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Frontiers in Algorithmics/ edited by Jianxin Wang, Chee Yap.
其他題名:	9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings /
其他作者:	Wang, Jianxin.
面頁冊數:	XI, 335 p. 54 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-319-19647-3
ISBN:	9783319196473

Frontiers in Algorithmics = 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings /
Frontiers in Algorithmics9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings /[electronic resource] :edited by Jianxin Wang, Chee Yap. - 1st ed. 2015. - XI, 335 p. 54 illus.online resource. - Theoretical Computer Science and General Issues ;9130. - Theoretical Computer Science and General Issues ;9163.

Graph Modification Problems: A Modern Perspective -- Soft Subdivision Search in Motion Planning, II: Axiomatics -- On r-Gatherings on the Line -- A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow -- Efficient Computation of the Characteristic Polynomial of a Threshold Graph -- A Fast and Practical Method to Estimate Volumes of Convex Polytopes -- Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine -- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation -- A Linear Time Algorithm for Ordered Partition -- Machine Scheduling with a Maintenance Interval and Job Delivery Coordination -- Lower and Upper Bounds for Random Mimimum Satisfiability Problem -- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields -- Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints -- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs -- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties -- Smaller Kernels for Several FPT Problems Based on Simple Observations -- ParameterizedMinimum Cost Partition of a Tree with Supply and Demand -- The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension -- Union Closed Tree Convex Sets -- Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores -- A New Distributed Algorithm for Computing a Dominating Set on Grids -- Approximate Model Counting via Extension Rule -- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory -- Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response -- Local Search to Approximate Max NAE-k-Sat Tightly -- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs -- Enumeration, Counting, and Random Generation of Ladder Lotteries -- Efficient Modular Reduction Algorithm Without Correction Phase -- Super Solutions of Random Instances of Satisfiability -- A Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization for Smart Grid Application.

This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. The 28 papers presented in this volume were carefully reviewed and selected from 65 submissions. They deal with graph algorithms, approximation algorithms, combinatorial optimization, parameterized algorithms, and online algorithms.

ISBN: 9783319196473

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

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Frontiers in Algorithmics = 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings /
LDR:04039nam a22004095i 4500 001 963213
003 DE-He213
005 20200706113219.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319196473 $9 978-3-319-19647-3
024 7 $a 10.1007/978-3-319-19647-3 $2 doi
035 $a 978-3-319-19647-3
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Frontiers in Algorithmics $h [electronic resource] : $b 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings / $c edited by Jianxin Wang, Chee Yap.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XI, 335 p. 54 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 9130
505 0 $a Graph Modification Problems: A Modern Perspective -- Soft Subdivision Search in Motion Planning, II: Axiomatics -- On r-Gatherings on the Line -- A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow -- Efficient Computation of the Characteristic Polynomial of a Threshold Graph -- A Fast and Practical Method to Estimate Volumes of Convex Polytopes -- Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine -- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation -- A Linear Time Algorithm for Ordered Partition -- Machine Scheduling with a Maintenance Interval and Job Delivery Coordination -- Lower and Upper Bounds for Random Mimimum Satisfiability Problem -- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields -- Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints -- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs -- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties -- Smaller Kernels for Several FPT Problems Based on Simple Observations -- ParameterizedMinimum Cost Partition of a Tree with Supply and Demand -- The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension -- Union Closed Tree Convex Sets -- Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores -- A New Distributed Algorithm for Computing a Dominating Set on Grids -- Approximate Model Counting via Extension Rule -- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory -- Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response -- Local Search to Approximate Max NAE-k-Sat Tightly -- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs -- Enumeration, Counting, and Random Generation of Ladder Lotteries -- Efficient Modular Reduction Algorithm Without Correction Phase -- Super Solutions of Random Instances of Satisfiability -- A Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization for Smart Grid Application.
520 $a This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. The 28 papers presented in this volume were carefully reviewed and selected from 65 submissions. They deal with graph algorithms, approximation algorithms, combinatorial optimization, parameterized algorithms, and online algorithms.
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computers. $3 565115
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Computation by Abstract Devices. $3 669792
700 1 $a Wang, Jianxin. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 785766
700 1 $a Yap, Chee. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258159
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319196480
776 0 8 $i Printed edition: $z 9783319196466
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-19647-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)