000 04407nam a22005175i 4500
001 978-3-319-19647-3
003 DE-He213
005 20200421111845.0
007 cr nn 008mamaa
008 150626s2015 gw | s |||| 0|eng d
020 _a9783319196473
_9978-3-319-19647-3
024 7 _a10.1007/978-3-319-19647-3
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aFrontiers in Algorithmics
_h[electronic resource] :
_b9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings /
_cedited by Jianxin Wang, Chee Yap.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXI, 335 p. 54 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9130
505 0 _aGraph 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 _aThis 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 _aComputer science.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputation by Abstract Devices.
700 1 _aWang, Jianxin.
_eeditor.
700 1 _aYap, Chee.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319196466
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9130
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-19647-3
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c55795
_d55795