Combinatorial Optimization and Applications: 14th International Conference, COCOA 2020, Dallas, TX, USA, December 11–13, Proceedings

Preface
Organization
Contents
Approximation Algorithms
Approximate Ridesharing of Personal Vehicles Problem
1 Introduction
2 Preliminaries
3 NP-Hardness Results
3.1 Both Minimization Problems Are NP-Hard
3.2 Inapproximability Results
3.3 NP-Hardness Result for Time Constraint Condition
4 Approximation Algorithms for Stop Constraint Condition
4.1 Approximation Algorithms Based on MCMP
4.2 A More Practical New Approximation Algorithm
5 Conclusion
References
A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee
1 Introduction
2 Preliminaries
2.1 Problem Definitions
2.2 Minimum Enclosing Spheres
2.3 Delaunay Triangulation
2.4 Walking in Delaunay Triangulation
2.5 (c,r)-NN
3 Algorithm
3.1 Preprocessing Algorithm
3.2 Query Algorithm
4 Analysis
4.1 Correctness
4.2 Complexities
5 Conclusion
References
Sampling-Based Approximate Skyline Calculation on Big Data
1 Introduction
2 Problem Definition
2.1 Skyline Definition
3 The Baseline Algorithm and Analysis
3.1 The Algorithm
3.2 Error Analysis of the Baseline Algorithm
3.3 Analysis of the Time Complexity
4 DOUBLE and Analysis
4.1 Error Analysis of DOUBLE
4.2 Analysis of Sample Size and Time Complexity
5 Conclusion
References
Approximating k-Orthogonal Line Center
1 Introduction
1.1 Previous Results
1.2 Our Result
1.3 Organisation of the Paper
1.4 Overview of the Algorithm
2 Preliminaries
3 Description of the Algorithm
3.1 Phase I of the Algorithm
3.2 Phase II of the Algorithm
3.3 Phase III of the Algorithm
3.4 Running Time of the Algorithm
4 Conclusion
References
Selecting Sources for Query Approximation with Bounded Resources
1 Introduction
2 Problem Definition
2.1 Basic Notions and Quality Metric
2.2 Problems
2.3 Complexity Results
3 Algorithm for Source Selection
3.1 Algorithm for BNMG
3.2 Algorithm for BCMG
3.3 Improvement for Algorithms
4 Experimental Results
4.1 Experiment Setup
4.2 Comparison
4.3 Efficiency and Scalability
5 Related Work
6 Conclusion
References
Parameterized Complexity of Satisfactory Partition Problem
1 Introduction
2 Polynomial Time Algorithm on Block Graphs
3 Graphs of Bounded Clique-Width
4 W[1]-Hardness Parameterized by Treewidth
5 Conclusion
References
An Approximation of the Zero Error Capacity by a Greedy Algorithm
1 Introduction
2 Fractional Independence Number
3 Capacity Approximation
4 Greedy Algorithms
5 Community Detection Problems
References
Scheduling
On the Complexity of a Periodic Scheduling Problem with Precedence Relations*-6pt
1 Introduction
2 Problem Description
2.1 Problem Statement
2.2 Equivalence Proof
3 Problem Complexity
3.1 PSPcom
3.2 Job Shop Scheduling Problem JS3
3.3 Naive Incomplete Reduction
3.4 Anchoring Chains
4 Heuristic Approach
4.1 Algorithm Overview
4.2 Experimental Results
5 Conclusions and Future Work
References
Energy-Constrained Drone Delivery Scheduling
1 Introduction
2 Related Works
3 Motivation and Problem Definition
4 UAS Energy-Constrained Scheduling Algorithm
5 Performance Evaluation
6 Conclusions
References
Scheduling Jobs with Precedence Constraints to Minimize Peak Demand
1 Introduction
2 Related Work
3 Problem Formulation
4 Approximation Algorithm
5 Evaluation
6 Conclusions
References
Reachability Games for Optimal Multi-agent Scheduling of Tasks with Variable Durations
1 Introduction
2 The Agent Resource-Constrained Project Scheduling Problem and Windows
3 Encoding Valid Schedules as Paths in a Graph
4 Reachability Games for Optimal Scheduling
4.1 Two-Player Reachability Games
4.2 Optimal Scheduling
4.3 Extracting the Optimal Schedule
4.4 Minimizing Total Load and Makespan
5 Experimental Evaluation
5.1 Qualitative Evaluation
5.2 Randomized Evaluation and Comparison with an Integer Programming Formulation
6 Conclusion
References
Improved Scheduling with a Shared Resource via Structural Insights
1 Introduction
1.1 Basic System Model
1.2 Related Work
1.3 Our Contribution
2 Preliminaries
3 A Lower Bound for SRJS
4 Approximation Algorithm and Analysis
5 Additional Results
6 Conclusion and Open Problems
References
Network Optimization
Two-Stage Pricing Strategy with Price Discount in Online Social Networks
1 Introduction
2 Related Work
2.1 Propagation Model
2.2 Pricing Strategy
3 Preliminaries
3.1 Propagation Model
3.2 Problem Formulation
4 Solution
4.1 Pricing Strategies
4.2 Two-Stage with Discount Greedy (TSDG) Algorithm
5 Evaluations
5.1 Experimental Setup
5.2 Profit Results of Different Algorithms
6 Conclusion
References
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks
1 Introduction
2 Preliminaries
2.1 Notations
2.2 Aggregate Evacuation Time on a Path
3 Algorithms
4 Data Structures Associated with Nodes of T
5 Conclusion
References
Matched Participants Maximization Based on Social Spread
1 Introduction
2 Related Work
3 Problem Model and Analysis
3.1 Interest-Based Forwarding Model (IF)
3.2 Matching Strategies
3.3 The MPM Problems
4 The Algorithms Designs
4.1 MRS-Based Algorithm for MPM-NM
4.2 Sandwich Algorithm for MPM-GM
5 Experiments
5.1 Experiment Setup
5.2 Experiments Result
6 Conclusions
References
Mixed-Case Community Detection Problem in Social Networks
1 Introduction
2 Related Works
3 Problem Definition
4 Worst-Case Community Detection Problem
5 Average-Case Community Detection
6 General-Case Community Detection
7 Conclusions
References
How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations
1 Introduction
2 Preliminaries
3 Feasibility
4 NP-Hardness
5 Lower Bound for a k-Degree-Anonymous Graph
6 Approximation
7 Polynomial Cases
7.1 Trees
7.2 One Degree Class, k=n
8 Conclusion
References
The Small Set Vertex Expansion Problem
1 Introduction
2 Preliminaries
3 Proving Small Set Vertex Expansion is NP-complete
4 W[1]-Hardness Parameterized by k
5 FPT Algorithm Parameterized by Neighbourhood Diversity
6 FPT Algorithm Parameterized by Treewidth
7 Conclusion
References
Complexity and Logic
On Unit Read-Once Resolutions and Copy Complexity
1 Introduction
2 Statement of Problems
3 Motivation and Related Work
4 The UROR Problem for Horn Formulas
5 Copy Complexity and Horn Constraints
6 Derived-Copy Complexity
7 The UROR Problem for 2-CNF Formulas
8 Conclusion
References
Propositional Projection Temporal Logic Specification Mining
1 Introduction
2 Propositional Projection Temporal Logic
3 Pattern Library Construction and Trace Generation
3.1 Pattern and Pattern Library
3.2 Trace Generation
4 PPTL Specification Mining
4.1 The Framework of PPTLMiner
4.2 Mining Process and Algorithms
5 Conclusion
References
An Improved Exact Algorithm for the Exact Satisfiability Problem
1 Introduction
2 Preliminaries
2.1 Branching Factor and Vector
2.2 Definitions
2.3 A Nonstandard Measure
3 Algorithm
4 Analysis of Algorithm
4.1 Line 10 of the Algorithm
4.2 Line 11 of the Algorithm
4.3 Line 12 of the Algorithm
4.4 Line 13 of the Algorithm
References
Transforming Multi-matching Nested Traceable Automata to Multi-matching Nested Expressions
1 Introduction
2 Multi-matching Nested Words
2.1 Multi-matching Nested Relation
2.2 Word Encoding
3 Multi-matching Nested Languages
3.1 Multi-matching Nested Expressions
3.2 Multi-matching Nested Traceable Automata
4 A Transformation Method from MNTA to MNE
4.1 Labelled Arcs
4.2 Transformation
4.3 Example
5 Conclusion
References
On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope
1 Introduction
1.1 Extension Complexity
2 Relaxations of QAPn
3 A New Class of Facet-Defining Inequalities
4 Membership Testing
5 Extension Complexity
References
Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles
1 Introduction
1.1 Problem Statements and Results
1.2 Relations to Uncertain Visibility
1.3 Related Work
2 Reduction
2.1 Correctness of the Reduction
3 All-Equal Segment Cover
4 Approximation
4.1 Hardness of Approximation for Max-SC
References
On the Complexity of Minimum Maximal Uniquely Restricted Matching
1 Introduction
2 Preliminaries
3 Minimum Maximal Uniquely Restricted Matching in Subclasses of Bipartite Graphs
3.1 Chordal Bipartite Graphs
3.2 Bipartite Permutation Graphs
4 Minimum Maximal Uniquely Restricted Matching in Subclasses of Chordal Graphs
4.1 Chordal Graphs
4.2 Proper Interval Graphs
5 APX-completeness for Bounded Degree Graphs
6 Conclusions
References
Search, Facility and Graphs
A Two-Layers Heuristic Search Algorithm for Milk Run with a New PDPTW Model
1 Introduction
2 Problem Description and Model
3 Algorithm Design
3.1 Inner Search of Algorithm
3.2 Outer Search of Algorithm
4 Computational Experiments
4.1 Conclusion
References
Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives
1 Introduction
2 Definitions and Preliminary Results
3 Upper Bound for Non-adaptive Deterministic Algorithms
4 Lower Bound for Adaptive Deterministic Algorithm
5 Polynomial Time Adaptive Algorithm
6 Polynomial Time Non-adaptive Algorithm
6.1 Algorithms Using Expanders
6.2 Algorithms Using Extractors and Condensers
References
Nearly Complete Characterization of 2-Agent Deterministic Strategyproof Mechanisms for Single Facility Location in Lp Space
1 Introduction
2 Preliminaries
3 Nearly Complete Characterization of Deterministic Mechanisms
3.1 One-Dimensional Situation
3.2 Multi-dimensional L2 Situation
3.3 Multi-dimensional Lp Situation
4 Two Special Cases
4.1 Dictatorial Mechanisms
4.2 Anonymous Mechanisms
5 Discussion
References
Packing and Covering Triangles in Dense Random Graphs
1 Introduction
2 G(n,p) Random Graph Model
3 G(n,m) Random Graph Model
4 Conclusion and Future Work
References
Mechanism Design for Facility Location Games with Candidate Locations
1 Introduction
2 Model
3 Single-Facility Location Games
3.1 Line Space
3.2 General Metric Spaces
4 Two-Facility Location Games
4.1 Social-Cost Objective
4.2 Maximum-Cost Objective
5 Conclusion
References
Geometric Problem
Online Maximum k-Interval Coverage Problem
1 Introduction
2 Preliminaries
3 Lower Bounds
4 Upper Bounds
4.1 Dynamic Programming Based Optimal Offline Solution
4.2 Single-Threshold Online Algorithm
4.3 Double-Threshold Online Algorithm
5 Concluding Remarks
References
Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains
1 Introduction
2 Vertex Fault-Tolerant Spanner for Weighted Points in a Simple Polygon
3 Vertex Fault-Tolerant Spanner for Weighted Points in a Polygonal Domain
4 Conclusions
References
Competitive Analysis for Two Variants of Online Metric Matching Problem
1 Introduction
1.1 Our Contributions
1.2 Related Work
2 Preliminaries
2.1 Online Metric Matching Problem with Two Servers
2.2 Online Facility Assignment Problem on a Line
2.3 Competitive Ratio
3 Online Metric Matching Problem with Two Servers
3.1 Upper Bound
3.2 Lower Bound
4 Online Facility Assignment Problem on Line
5 Conclusion
References
Guarding Disjoint Orthogonal Polygons in the Plane
1 Introduction
2 Related Work
3 Axis-Aligned Orthogonal Polygons
4 Arbitrary-Oriented Orthogonal Polygons
5 Conclusion
References
Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints
1 Introduction
2 Definitions and Preliminary Concepts
3 Characterization of Optimal Placements for Alice and Bob
3.1 A Characterization of Clients of Alice and Bob
3.2 A Necessary and Sufficient Condition for Alice and Bob
4 Algorithm to Compute the Common Intersection of Ellipses
5 Bounds for the Scores in the Voronoi Game on Polygons
5.1 Tight Lower and Upper Bounds for the Scores in the Voronoi Game on Simple Polygons
5.2 Bounds on Voronoi Games on Convex Polygons
6 Strategy for Adversary Bob
7 Strategy for Server Alice
7.1 Algorithm to Compute an Optimal Placement of A
References
Cutting Stock with Rotation: Packing Square Items into Square Bins
1 Introduction
2 A Review of the 1-Bin Square Packing (1BSP) Problem
3 An APTAS for Square Packing with Rotation
3.1 Triangle and Trapezoid Packing
3.2 Packing Large Items
3.3 Packing Arbitrary Input
References
Miscellaneous
Remotely Useful Greedy Algorithms
1 Introduction
1.1 Related Work
1.2 Contribution
2 Formal Problem Statement
3 Hardness and Cost Hierarchy
4 Greedy Algorithms and Approximation Guarantees
4.1 Algorithms
4.2 Approximation Guarantee
5 Instance-Based Upper Bounds
6 Experiments
6.1 Benchmark Graphs
6.2 Results
7 Conclusions and Future Work
References
Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge
1 Introduction
2 Preliminaries
3 Parameterization by Both the Maximum Number of Crossings per Edge and the Vertex Cover Number
3.1 Three Types of Crossing Number Matrices in the Record Set
3.2 A Parameterized Algorithm for the Problem FDVC
4 Parameterization by both the Maximum Number of Crossings per Edge and the Pathwidth of the Vertex Ordering
4.1 Two Types of Crossing Data Matrices in the Record Set
4.2 A Parameterized Algorithm for the Problem FDPW
5 Conclusions
References
Fractional Maker-Breaker Resolving Game
1 Introduction
2 Some Known Results on the MBRG
3 General Results on the Outcome of the FMBRG
4 The Outcome of the FMBRG on Some Classes of Graphs
References
Price of Fairness in Budget Division for Egalitarian Social Welfare
1 Introduction
1.1 Our Results
1.2 Related Work
2 Preliminaries
3 Guarantees for Fairness Axioms
4 Guarantees for Voting Rules
5 Conclusion
References
Inspection Strategy for On-board Fuel Sampling Within Emission Control Areas
1 Introduction
2 Description of Ships’ Violation Behaviors
3 Model Formulation and Algorithm
4 Results and Discussion
4.1 Data
4.2 Optimal Inspection Strategy
4.3 Analysis of Influencing Factors
5 Conclusions
References
Novel Algorithms for Maximum DS Decomposition
1 Introduction
2 Related Works
3 Deterministic Conditioned Greedy Algorithm
4 Two Special Cases for Deterministic Conditioned Greedy
4.1 Case 1
4.2 Case 2
5 Random Conditioned Greedy Algorithm
6 Two Special Cases for Random Conditioned Greedy
6.1 Case 1
6.2 Case 2
7 Conclusions
References
Reading Articles Online
1 Introduction
1.1 Related Work
1.2 Our Contribution
2 Preliminaries
3 Lower Bounds
4 Exploitation of Online Knapsack Algorithms
5 Threshold Algorithm
6 Open Questions
References
Sensors, Vehicles and Graphs
An Efficient Mechanism for Resource Allocation in Mobile Edge Computing*-6pt
1 Introduction
2 Related Work
3 System Model
3.1 System Overview
3.2 Power Model in MEC
3.3 Resource Model in MEC
3.4 Profit Model in MEC
4 Problem Formulation
5 Algorithm Design
6 Simulation Result
6.1 Simulation Settings
6.2 Performance Evaluation
7 Conclusion
References
Data Sensing with Limited Mobile Sensors in Sweep Coverage
1 Introduction
2 Related Work
3 Problem Formulation
4 GD-MSDSC
5 MST-MSDSC
6 Experimental Results
7 Conclusions and Future Work
References
Trip-Vehicle Assignment Algorithms for Ride-Sharing
1 Introduction
2 The Model
3 Approximation Algorithm
3.1 Minimum-Weight Fixed-Size Matching with Unmatched Vertex Penalty
3.2 Algorithm DPAA
3.3 Approximation Ratio
4 Dynamic Assignment Algorithm
4.1 Minimum Weight Matching with Unmatched Vertex Penalty
4.2 Driver Passenger Greedy Assignment Algorithm (DPGA)
4.3 Experiments
5 Conclusions
References
Minimum Wireless Charger Placement with Individual Energy Requirement
1 Introduction
2 Related Works
3 System Model and Problem Formulation
3.1 System Model and Assumptions
3.2 Problem Formulation
4 Algorithms for the PIO Problem
4.1 The Greedy Based Algorithm
4.2 The Relax Rounding Algorithm
5 Performance Evaluation
5.1 Performance Comparison
6 Conclusions
References
An Efficient Algorithm for Routing and Recharging of Electric Vehicles
1 Introduction
2 Problem Definition
2.1 Complexity of EVRRP
3 Optimal Solution for EVRRP
4 An Illustrative Example
5 An Efficient Algorithm for EVRRP
5.1 Properties of APX-EVRRP
6 Conclusion
References
The Optimization of Self-interference in Wideband Full-Duplex Phased Array with Joint Transmit and Receive Beamforming
1 Introduction
2 Models and Algorithms
3 Simulations and Results
References
Graph Problems
Oriented Coloring of msp-Digraphs and Oriented Co-graphs (Extended Abstract)
1 Introduction
2 Preliminaries
2.1 Graphs and Digraphs
2.2 Coloring Undirected Graphs
2.3 Coloring Oriented Graphs
3 Coloring msp-Digraphs
4 Coloring Transitive Acyclic Digraphs
5 Coloring Oriented Co-graphs
6 Conclusions and Outlook
References
Star-Critical Ramsey Number of Large Cycle and Book
1 Introduction
2 Proof
References
Computing Imbalance-Minimal Orderings for Bipartite Permutation Graphs and Threshold Graphs
1 Introduction
2 Preliminaries
3 Bipartite Permutation Graphs
4 Threshold Graphs
5 Improved Imbalance Parameterized by Vertex Cover
6 Conclusion
References
Inductive Graph Invariants and Algorithmic Applications
1 Introduction
2 Inductive Versions of Graph Invariants for Unweighted Graphs
3 On the Computation of fIND(G)
4 r-Distance Inductive Invariants for Weighted Graphs
5 Approximation of Optimal P-Subgraphs
5.1 Approximation of Maximum Induced (k,P)-Colorable Subgraphs
5.2 Approximation of Maximum Induced (P1, …, Pk)-Colorable Subgraphs
6 Approximation of Minimum P-Coloring
7 Conclusions
References
Constructing Order Type Graphs Using an Axiomatic Approach
1 Introduction
2 Preliminaries
3 Convex Position
4 Axioms 1,2, and 3 only
5 Algorithms
6 Experiments
7 Concluding Remarks
References
FISSION: A Practical Algorithm for Computing Minimum Balanced Node Separators
1 Introduction
1.1 Related Work
1.2 Contribution
2 Properties of Minimum Balanced Node Separators
3 The FISSION Algorithm
3.1 Preprocessing Phase
3.2 Branching Phase
4 Experimental Evaluation
4.1 Data and Settings
4.2 Preprocessing Results
4.3 Branching Results
5 Showcases
6 Conclusions and Future Work
References
Author Index