LEADER 04345nam 22006975 450 001 996466275403316 005 20230329170922.0 010 $a3-319-59605-5 024 7 $a10.1007/978-3-319-59605-1 035 $a(CKB)4340000000061552 035 $a(DE-He213)978-3-319-59605-1 035 $a(MiAaPQ)EBC6303064 035 $a(MiAaPQ)EBC5577823 035 $a(Au-PeEL)EBL5577823 035 $a(OCoLC)990774799 035 $a(PPN)202990699 035 $a(EXLCZ)994340000000061552 100 $a20170522d2017 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFrontiers in Algorithmics$b[electronic resource] $e11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings /$fedited by Mingyu Xiao, Frances Rosamond 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (X, 281 p. 50 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10336 300 $aIncludes index. 311 $a3-319-59604-7 327 $aOn the Complexity of Minimizing the Total Calibration Cost -- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. - The complexity of finding (approximate sized) distance d dominating sets in tournaments -- On Computational Aspects of Greedy Partitioning of Graphs -- Maximum Edge Bicliques in Tree Convex Bipartite Graphs -- Complete Submodularity Characterization in the Comparative Independent Cascade Model -- A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate -- Designing and Implementing Algorithms for the Closest String Problem -- The Broken-Triangle Property with Adjoint Values -- Online Knapsack Problem under Concave Functions -- Fluctuated Fitting under the L1-metric -- Optimal Partitioning Which Maximizes the Weighted Sum of Products -- Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity -- Online Strategies for Evacuating from a Convex Region in the Plane -- A further analysis of the dynamic dominant resource fairness mechanism -- A 42k Kernel for the Complementary Maximal Strip Recovery Problem -- On-line Scheduling with a Monotonous Subsequence Constraint -- A 1.4-Approximation Algorithm For Two-sided Scaffold Filling -- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters -- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order -- Geodectic Contraction Games on Trees -- On Approximation Algorithms for Two-Stage Scheduling Problems -- A New Lower Bound for Positive Zero Forcing -- Phase Transition for Maximum Not-All-Equal Satisfiability. . 330 $aThis book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017. The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10336 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aArtificial intelligence?Data processing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aArtificial intelligence?Data processing. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aData Science. 676 $a005.1 702 $aXiao$b Mingyu$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRosamond$b Frances$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466275403316 996 $aFrontiers in algorithmics$958649 997 $aUNISA