Frontiers in Algorithmics and Algorithmic Aspects in Information and Management Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings

This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013. The 33 revised full papers presente...

Full description

Saved in:
Bibliographic Details
Main Authors Fellows, Michael, Tan, Xuehou, Zhu, Binhai
Format eBook
LanguageEnglish
Published Berlin, Heidelberg Springer Nature 2013
Springer Berlin / Heidelberg
Springer Berlin Heidelberg
Springer
Edition1
SeriesLecture Notes in Computer Science
Subjects
Algorithm Analysis and Problem Complexity
Computer algorithms
Computer algorithms-Congresses
Computer programming, programs, data
Computer Science
Data Structures
Discrete Mathematics in Computer Science
Management of Computing and Information Systems
Mathematics of Computing
Theory of Computation
Online AccessGet full text
ISBN364238756X
9783642387562
9783642387555
3642387551
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-38756-2

Cover

Table of Contents:
  • 5.2 Impossibility of Disavowal by the Signatory and the Receiver -- 5.3 Impossibility of Forgery -- 5.4 Other Discussion -- 6 Conclusions -- References -- Randomized Algorithms for Removable Online Knapsack Problems -- 1 Introduction -- 2 Unweighted Knapsack Problem -- 2.1 Upper Bound -- 2.2 Lower Bound -- 3 Weighted Knapsack Problem -- 3.1 Upper Bound -- 3.2 Lower Bound -- References -- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs -- 1 Introduction -- 2 Notation System -- 3 Reduction Rules -- 4 Properties of Vertex-Cuts with Size at Most 2 -- 5 Branching Rules -- 6 The Algorithm and Results -- 6.1 Framework for Analysis -- 6.2 The Algorithm -- 6.3 The Result -- 7 Framework for the Proof of Lemma 6 -- References -- FWLS: A Local Search for Graph Coloring -- 1 Introduction -- 2 Preliminary -- 3 Focused Walk Based Local Search for Graph Coloring -- 3.1 Basic Notation and Definitions -- 3.2 The FWLS Algorithm -- 4 Experimental Results -- 5 Conclusion and Future Work -- References -- A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids -- 1 Introduction -- 2 A One-Vertex Decomposition Method (1-VDM) -- 3 A One-Vertex Decomposition Algorithm (1-VDA) -- 4 Comparison of 1-VDA with Other Algorithms -- 5 Conclusions and Future Work -- References -- Monomial Testing and Applications -- 1 Introduction -- 2 Notations and Definitions -- 3 A New Transformation -- 3.1 A New Circuit Reconstruction Method -- 3.2 Variable Replacements -- 4 A Faster Randomized Algorithm -- 5 A Deterministic Algorithm via Derandomization -- 6 Applications -- 6.1 Allowing Overlapping in -- 6.2 Testing Non-Simple -- 6.3 A Generalized -- References -- The Optimal Rescue Path Set Problem in Undirected Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Properties of Optimal Rescue Path Set -- 3.1 Minimum Joint Replacement Path Set
  • Kernelization and Lower Bounds of the Signed Domination Problem -- 1 Introduction -- 2 Preliminaries -- 3 The Complexity of -- 4 Kernelizations of -- 4.1 Kernel for General Graphs -- 4.2 Kernel for Planar Graphs -- 4.3 Kernel for d-Partite Graphs -- 4.4 Kernel for Bounded-Degree Graphs -- 4.5 Kernel for r-Regular Graphs -- 4.6 Kernel for Grid Graphs -- 5 Conclusion -- References -- On Edge-Independent Sets -- 1 Introduction -- 2 Rankwidth of Edge-Clique Graphs of Cocktail Parties -- 3 Algorithms for Distance-Hereditary Graphs and Related Graph Classes -- 3.1 Cographs -- 3.2 Distance-Hereditary Graphs -- 3.3 P4-Sparse Graphs -- 4 Algorithms for Planar Graphs -- 4.1 Planar Graphs without Triangle Separator -- 5 NP-Completeness for Graphs without Odd Wheels -- 6 Concluding Remarks -- References -- On the Complexity of Approximate Sum of Sorted List -- 1 Introduction -- 2 Algorithm for Approximate Sum of Sorted List -- 2.1 Approximate Region -- 2.2 Approximate Sum -- 3 Lower Bounds -- 3.1 Lower Bound for Computing Approximate Sum -- 3.2 Lower Bound for Computing Approximate Region -- 3.3 Lower Bound for Sorted List with Negative Elements -- 4 Conclusions and Open Problems -- References -- Large Hypertree Width for Sparse Random Hypergraphs -- 1 Introduction -- 2 Preliminaries -- 3 Lower Bound on Hypertree Width for Random Hypergraphs -- 4 Conclusion and Open Problems -- References -- On Perfect Absorbants in De Bruijn Digraphs -- 1 Introduction -- 2 Preliminaries -- 3 Perfect Absorbants of GB(n,d) -- 4 GB(n,d) with d = 2c(k−1)+1 -- 5 Concluding Remarks -- References -- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width -- 1 Introduction -- 2 Preliminaries -- 2.1 Graph -- 2.2 Branch Decomposition -- 2.3 Logic -- 3 Logical Approach -- 4 Dynamic Programming Approach -- 4.1 Computing -- 4.2 Proof of the Correctness -- 5 Conclusion -- References
  • 4 Optimal Rescue Path Set -- 5 Conclusion -- References -- Expected Computations on Color Spanning Sets -- 1 Introduction -- 2 Problem Definition -- 3 Algorithm for Problem 1 -- 4 Algorithm for Problem 2 -- 5 Algorithm for Problem 3 -- 6 Algorithm for Problem 4 -- 7 Algorithm for Problem 5 -- 8 Conclusions -- References -- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Reduction from Circular-Convex Bipartite Graphs -- 4 Reduction from Triad-Convex Bipartite Graphs -- 5 Concluding Remarks -- References -- Spanning Distribution Trees of Graphs -- 1 Introduction -- 2 NP-Completeness -- 3 Pseudo-polynomial Algorithm -- 3.1 Outline of Algorithm -- 3.2 Definitions of Functions -- 3.3 Algorithm -- 3.4 Computation Time -- 4 Concluding Remarks -- References -- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem -- 1 Introduction -- 2 Problem Formulation -- 3 Results on TDCPP Polyhedron -- 3.1 Affinely Independent TDCPP-Tours in CA Polytope -- 3.2 Dimension of CA Polytope -- 3.3 Facet Defining Inequalities for the CA Polytope -- 3.4 Further Strong Valid Inequalities for TDCPP -- 4 Description of the Cutting Plane Heuristic Algorithm -- 5 Computational Results -- 6 Conclusion -- References -- Zero-Visibility Cops and Robber Game on a Graph -- 1 Introduction -- 2 Zero-Visibility Cops and Robber -- 3 Pathwidth and the Zero-Visibility Copnumber -- 4 Constructions -- 5 Comparisons between the Zero-Visibility Copnumbers and the Pathwidth of a Graph -- 6 Conclusion -- References -- On (k, l)-Graph Sandwich Problems -- 1 Introduction -- 2 The Strongly Chordal-(2, 1) Graph Sandwich Problem -- 2.1 The Strongly Chordal-(k, l) Graph Sandwich Problem, k ≥ 2, l ≥ 1 -- 3 Graph Sandwich Problems with Boundary Conditions
  • 3.1 (Poly-Color(k), (k, l), Polynomial Number of Maximal Cliques)- sp -- 4 Conclusion -- References -- Fixed-Parameter Tractability ofWorkflow Satisfiability in the Presence of Seniority Constraints -- 1 Introduction -- 2 Preliminaries -- 3 FPT Algorithm for Bounded Treewidth -- 4 Hardness -- 5 Concluding Remarks -- References -- Two-Round Discrete Voronoi Game along a Line -- 1 Introduction -- 2 Lower Bounds -- 3 Optimal Strategies of P1 and P2 While Placing Second Facilities -- 4 Optimal Strategy of P2 While Placing the First Facility -- 5 Optimal Strategy of P1 While Placing the First Facility -- References -- Inverse Maximum Flow Problems under the Combining Norms -- 1 Introduction -- 2 Inverse Maximum Flow Problem under the Sum-Type Combining Norms -- 3 Inverse Maximum Flow Problem under the Bottleneck-Type Combining Norms -- 4 Concluding Remarks -- References -- The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs -- 1 Introduction, Notation and Terminology -- 2 Construction of Monochromatic Structures in -- 3 Construction of PEC Paths, Trails and Cycles -- 3.1 The Non-Oriented Case -- 3.2 The Oriented Case -- 4 Destruction of pec Cycles and pec Closed Trails in Gc -- References -- A Cost-Efficient Scheduling Algorithm for Traffic Grooming -- 1 Introduction -- 2 Problem Formulation -- 3 The Approximation Algorithm: Longest Link Interval First -- 4 Conclusion -- References -- Strategies of Groups Evacuation from a Convex Region in the Plane -- 1 Introduction -- 2 Preliminary -- 3 Lower Bound -- 4 Scenario 1: General Plane -- 5 Scenario 2: Plane with Grid Network -- 5.1 Analysis of Strategy with Boundary Information -- 5.2 Analysis of Strategies without Boundary Information -- 6 Comparison -- 6.1 Comparison of Different Scenarios -- 6.2 Comparison of Different Cases -- 7 Conclusion -- References
  • Intro -- Preface -- Organization -- Table of Contents -- Invited Lectures -- The Square Root Phenomenon in Planar Graphs -- An Algorithm for Determining Whether a Pair of Polygons Is Reversible -- References -- Contributed Papers -- Disjoint Small Cycles in Graphs and Bipartite Graphs -- 1 Introduction -- 2 Lemmas -- 3 Proof of Theorem 1.3 -- 4 Bipartite Graph -- 5 Conjectures -- References -- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree -- 1 Introduction -- 2 Results -- References -- Algorithms for Testing Length Four Permutations -- 1 Introduction -- 2 Preliminaries -- 3 Length Four Permutations Except 1324 -- 4 Permutation 1324 -- 5 Concluding Remarks -- References -- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Approximation Algorithms for the Unweighted Case -- 2.1 Edge Addition Based Algorithm -- 2.2 Edge Deletion Based Algorithm -- 2.3 LP Based Algorithm -- 2.4 Algorithm for IP2 -- 3 Approximation Algorithm for the Weighted Case -- 3.1 The Algorithm -- 4 Exact Algorithm for Trees -- References -- Faster Exact Computation of rSPR Distance -- 1 Introduction -- 2 Preliminaries -- 3 Sketch of Whidden et al.'s Algorithm for rSPR Distance -- 4 Ideas for Improving Whidden et al.'s Algorithm -- 5 Details of Step 5 in Section 4 When -- Is a Leaf -- 6 The Worst Case in Our Algorithm -- 7 Performance Comparison -- References -- Arbitrated Quantum Signature Schemes: Attacks and Security -- 1 Introduction -- 2 Quantum One-Time Pads Encryption -- 3 Attacks on Arbitrated Quantum Signature -- 3.1 Bob's Forgery Attacks -- 3.2 Alice's Disavowal Attacks -- 3.3 The Reasons for AQS Scheme Suffered Attacks -- 3.4 Other Attacks -- 4 An AQS Scheme -- 5 Security Analyses -- 5.1 The Method to Resolve Disputes
  • Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints