000 04247nam a22005895i 4500
001 978-3-319-59605-1
003 DE-He213
005 20240730191204.0
007 cr nn 008mamaa
008 170522s2017 sz | s |||| 0|eng d
020 _a9783319596051
_9978-3-319-59605-1
024 7 _a10.1007/978-3-319-59605-1
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aFrontiers in Algorithmics
_h[electronic resource] :
_b11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings /
_cedited by Mingyu Xiao, Frances Rosamond.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aX, 281 p. 50 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10336
505 0 _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. .
520 _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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aData Science.
_934092
700 1 _aXiao, Mingyu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9145484
700 1 _aRosamond, Frances.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9145485
710 2 _aSpringerLink (Online service)
_9145486
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319596044
776 0 8 _iPrinted edition:
_z9783319596068
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10336
_9145487
856 4 0 _uhttps://doi.org/10.1007/978-3-319-59605-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93656
_d93656