Frontiers in Algorithmics 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings

This book constitutes the proceedings of the 10th International Workshop on Frontiers in Algorithmics, FAW 2016, held in Qingdao, China, in June/July 2016.      The 25 full papers presented in this volume were carefully reviewed and selected from 54 submissions. They deal with algorithm, complexity,...

Full description

Saved in:
Bibliographic Details
Main Authors Zhu, Daming, Bereg, Sergey
Format eBook Conference Proceeding
LanguageEnglish
Published Cham Springer Nature 2016
Springer International Publishing AG
Springer International Publishing
Springer
Edition1
SeriesLecture Notes in Computer Science
Subjects
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Computer algorithms
Computer algorithms-Congresses
Computer programming, programs, data
Computer Science
Data Structures
Discrete Mathematics in Computer Science
Online AccessGet full text
ISBN9783319398174
3319398172
3319398164
9783319398167
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-39817-4

Cover

Table of Contents:
  • Intro -- Preface -- Organization -- Abstracts -- Algorithms for Queryable Uncertainty -- On Relating Parameterized Tractability and Polynomial-Time Approximability -- Genomic Scaffold Filling: A Progress Report -- Contents -- Algorithms for Queryable Uncertainty -- 1 Introduction -- 2 Preliminaries -- 3 Related Work -- 4 MST Under Uncertainty -- 5 Cheapest Set Under Uncertainty -- 6 Round-Competitive Algorithms -- 7 Conclusions -- References -- Genomic Scaffold Filling: A Progress Report -- 1 Introduction -- 2 Preliminaries -- 3 Current Status -- 3.1 Results on Filling Permutation Scaffolds -- 3.2 Results on One-Sided Scaffold Filling -- 3.3 Parameterized Results on Scaffold Filling -- 4 Future Research Directions -- References -- Better Approximation Algorithms for Scaffolding Problems -- 1 Introduction -- 2 Basic Definitions -- 3 Algorithms for the Scaffolding Problem -- 3.1 The Randomized Algorithm -- 3.2 Computation of P2 -- 3.3 Analysis of the Algorithm -- 3.4 Derandomization -- 4 An Approximation Algorithm for LGSP -- 5 Approximation Algorithms for GSP -- 5.1 A Ratio-3 Approximation Algorithm -- 5.2 The Special Case Where |D| p + 3c -- 5.3 The Special Case Where |D| p + (2+)c -- 5.4 The Special Case Where |D| 9(p + c) -- 5.5 The Special Case Where |D| 6(p + c) -- References -- How to Block Blood Flow by Using Elastic Coil -- 1 Introduction -- 2 r-blocking -- 3 Ball Winding Approach for Blocking Points -- 3.1 Finding a Narrow Slab -- 3.2 Relaxation for the Finding-Slab Algorithm -- 3.3 Coil Curve Generation -- 4 Evaluations -- 4.1 Performance of the r-blocking Algorithm -- 4.2 Performance of Coil Generation for Real Aneurysm Data -- 5 Conclusion -- References -- Linear Time Algorithm for 1-Center in d Under Convex Polyhedral Distance Function -- 1 Introduction -- 2 Concepts and Primitives
  • 2.1 Data Preprocessing -- 2.2 The Principle of Modeling -- 3 The Selection and Positioning Strategy of Virtual Machine to Be Migrated -- 4 Experiment and Analysis -- 5 Conclusions -- Acknowledgements -- References -- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs -- 1 Introduction -- 2 Preliminaries -- 3 The Polynomial Algorithm -- 3.1 The Upper Bound of Internal Vertices in a Spanning Tree -- 3.2 Algorithm -- 3.3 Analysis -- 4 Conclusions and Discussions -- References -- Fractional Edge Cover Number of Model RB -- 1 Introduction -- 2 Preliminaries -- 2.1 Model RB -- 2.2 Fractional Edge Cover -- 2.3 Chernoff Bound -- 3 Fractional Edge Cover Number of Model RB -- 4 Conclusions -- References -- Breaking Cycle Structure to Improve Lower Bound for Max-SAT -- 1 Introduction -- 2 A Basic Max-SAT Solver -- 2.1 Underestimation of Lower Bound -- 2.2 Inference Rules -- 3 Breaking Cycle Structure -- 3.1 Generalized Cycle Structure -- 3.2 A New Lower Bound with Cycle Breaking Rule -- 4 Evaluation of New Lower Bound -- 5 Conclusions -- References -- On Counting Parameterized Matching and Packing -- 1 Introduction -- 2 Preliminaries -- 3 The Complexity of p-m-Set Packing -- 4 The Complexity of p-m-D Matching -- 5 The FPTRAS for Considered Problems -- 5.1 The FPTRAS for p-m-Set Packing -- 5.2 The FPTRAS for p-m-Edge Disjoint Subgraph Packing -- 5.3 The FPTRAS for p-m-D Matching and p-2-B Matching -- 6 Conclusions -- References -- Online Scheduling with Increasing Subsequence Serving Constraint -- 1 Introduction -- 2 Preliminaries -- 2.1 Competitive Ratio -- 3 Min-OIS Problem and Max-OIS Problem -- 3.1 Min-OIS Problem -- 3.2 Max-OIS Problem -- 4 Conclusions -- References -- Notes on the 65-Approximation Algorithm for One-Sided Scaffold Filling -- 1 Introduction -- 2 Preliminaries
  • Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? -- 1 Introduction -- 2 Preliminaries -- 3 Simplification on the Breakpoint Graph and the Matching Graph -- 4 Our Algorithm -- 5 Conclusion -- References -- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique -- 1 Introduction -- 2 Definitions and Notation -- 3 Maximum Clique Algorithm MCS -- 3.1 Search Tree -- 3.2 Approximate Coloring: Numbering -- 3.3 Re-NUMBER -- 3.4 EXTENDED INITIAL SORT-NUMBER -- 4 Improved Algorithms -- 4.1 Effective Use of an Approximate Solution -- 4.2 EXTENDED INITIAL SORT-NUMBER Near the Root of the Search Tree -- 4.3 Lightened Numbering Mainly Near the Leaves of the Search Tree -- 5 Computational Experiments -- 5.1 Stepwise Improvement -- 5.2 Overall Improvement -- References -- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan -- 1 Introduction -- 2 A PTAS for the (m,k)-PFS Problem -- 2.1 Configuration -- 2.2 The PTAS -- 3 Conclusions -- References -- Kernelization of Two Path Searching Problems on Split Graphs -- 1 Introduction -- 2 Disjoint Paths -- 3 k-Path -- 4 Conclusion -- References -- The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs -- Abstract -- 1 Introduction -- 2 Related Works -- 3 Problem Description and Optical Properties -- 4 Algorithm -- 5 Conclusion -- Acknowledgments -- References -- Parallel Identifying (l,d)-Motifs in Biosequences Using CPU and GPU Computing -- 1 Introduction -- 2 Algorithm -- 3 Experiment -- 3.1 Experimental Environment and Data -- 3.2 Experimental Results -- 4 Conclusions -- References -- On the Lower Bounds of Random Max 3 and 4-SAT -- 1 Introduction -- 2 Weighting and Estimating -- 2.1 Our Weighting Scheme -- 2.2 Moment Estimations and Truncation -- 3 Experimental Results and Performance Analysis -- References
  • Finding Disjoint Dense Clubs in an Undirected Graph
  • 3 How to Approximate the Scaffold Filling -- 3.1 A Sufficient Condition for 65-Approximation -- 3.2 The Objective Function of Local Search -- 3.3 What Good String Substitutions Are Allowed -- 4 Why Is the Performance Ratio 65 -- 5 Conclusion -- References -- Nonlinear Dimension Reduction by Local Multidimensional Scaling -- 1 Introduction -- 2 The Proposed LMB Algorithm -- 2.1 Determine the Dimension of the Embedded Manifold -- 2.2 Dimension Reduction by LMB -- 2.3 Orthogonal Transformation -- 2.4 Algorithm Description -- 3 Experiments -- 4 Parameter Study of LMB -- 4.1 The Starting Point -- 4.2 The Size of the Neighbourhood -- 5 Conclusions and Future Work -- References -- Mechanism Design for One-Facility Location Game with Obnoxious Effects -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Works -- 2 Preliminaries -- 3 Hardness of Two Thresholds -- 3.1 Lower Bounds for d1 12 -- 4 Approximation Strategy-Proof Mechanisms -- 4.1 Majority Mechanism -- 4.2 Lower Bounds for d1 &lt -- 12 and d2 &gt -- 12 -- 4.3 A Family of Strategy-Proof Mechanisms for d2 1/2 -- 4.4 Randomized Mechanisms for d1 1/2 -- 5 Conclusion -- References -- Realtime Channel Recommendation: Switch Smartly While Watching TV -- 1 Introduction -- 2 Preliminaries -- 3 Offline Profit Maximization and Its Complexity -- 4 Online Profit Maximization -- 4.1 Online Algorithms -- 4.2 Online Profit Maximization with Annoying Cost -- 5 Conclusions and Future Work -- References -- Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One -- 1 Introduction -- 2 Related Work -- 3 Hamiltonian Cycles in Random Graphs with Degrees Greater Than One -- 4 Experiment Results -- 4.1 Results with Backtracking Algorithm -- 4.2 Results with Backtracking and SparseHAM Algorithm -- 5 Conclusion -- References
  • 3 Computing 1-Center Constrained on a Line Segment for Points in 2 Under Convex Polygonal Distance Function -- 3.1 Algorithm Analysis -- 4 Computing 1-Center for Points in 2 for a Given Convex Polygonal Distance Function -- 4.1 Algorithm Analysis -- 5 Computing 1-Center for Points in d for Convex Polyhedral Distance -- References -- Positive Zero Forcing and Edge Clique Coverings -- 1 Introduction -- 2 Simply Intersecting Edge Clique Coverings -- 3 Non-unique Edge Clique Coverings -- 4 Compressed Cliques Graphs -- 5 Uniqueness of Compressed Cliques Graphs -- 6 Min-Max Clique Coverings of Compressed Cliques Graphs -- 7 Positive Zero Forcing Sets in Compressed Cliques Graphs -- 8 Connections with Johnson Graphs -- 9 Forbidden Subgraphs of Compressed Cliques Graphs -- 10 Vertex-Clique Graphs -- 11 Relations Between Z+(G) and `39`42`"613A``45`47`"603Acc(G) -- 12 Concluding Remarks -- References -- Improved Algorithms for Several Parameterized Problems Based on Random Methods -- 1 Introduction -- 2 Algorithms for the Parameterized Weighted P3-Packing Problem -- 2.1 Weighted P3-Packing on Tripartite Graphs -- 2.2 Randomized Algorithm for Parameterized Weighted P3-Packing -- 3 Randomized Algorithm for Weighted Load Coloring -- 3.1 Algorithm for the Parameterized Claw-Free Edge Deletion Problem on Diamond-Free Graphs -- References -- Parameterized Algorithms for Maximum Edge Biclique and Related Problems -- 1 Introduction -- 2 Algorithm for Parameterized Edge Biclique Problem -- 3 Algorithm for Parameterized Edge Biclique Packing Problem -- 4 Algorithm for Parameterized Bipartite Biclique Edge Deletion Problem -- 5 Algorithm for Parameterized General Biclique Edge Deletion Problem -- References -- The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting Model -- Abstract -- 1 Introduction -- 2 Gray Forecasting Model