Frontiers in algorithmics : 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings /: 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings. (2017)

• Record Type: Book
• Other Titles: FAW 2017
• Further Information: Note: Mingyu Xiao, Frances Rosamond (eds.).
• Editors: Xiao, Mingyu; Rosamond, Frances
• Other Names: International Frontiers of Algorithmics Workshop, 11th
• Contents: On 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.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2017
• Extent: 1 online resource (x, 281 pages), illustrations
• Subjects: 005.1; Computer science; Computer algorithms -- Congresses; Computer algorithms; Computer Science; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Data Structures; Computers -- Data Processing; Computers -- Programming -- Algorithms; Computers -- Data Modeling & Design; Discrete mathematics; Mathematical theory of computation; Algorithms & data structures; Computer software; Computational complexity; Electronic data processing; Data structures (Computer science); Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783319596051; 3319596055; 3319596047; 9783319596044
• Related ISBNs: 9783319596044
• Notes: Note: Includes bibliographical references and author index.; Note: Online resource; title from PDF title page (SpringerLink, viewed June 22, 2017).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.