Algorithmic Aspects in Information and Management 13th International Conference, AAIM 2019, Beijing, China, August 6-8, 2019, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Du, Ding-Zhu (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Li, Lian (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sun, Xiaoming (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Zhang, Jialin (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: Theoretical Computer Science and General Issues ; 11640
• Θέματα: Computer science-Mathematics.; Numerical analysis.; Algorithms.; Data structures (Computer science).; Discrete Mathematics in Computer Science.; Numeric Computing.; Algorithm Analysis and Problem Complexity.; Data Structures.

This volume constitutes the proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019. The 31 full papers presented were carefully reviewed and selected. The papers deal with most aspects of theoretical comp...

Πίνακας περιεχομένων:

• One-Dimensional r -Gathering under Uncertainty
• Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees
• A Probabilistic Algorithm for Verification of Geometric Theorems
• Approximating Closest Vector Problem in infinte Norm Revisited
• Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable
• Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs
• Updating Matrix Polynomials
• On the Structure of Discrete Metric Spaces Isometric to Circles
• A 2.57-Approximation Algorithm for Contig-based Genomic Scaffold Filling
• Profit Parameterizations of Dominating Set
• Exponential Time Approximation Scheme for TSP
• Interaction-aware Influence Maximization and Iterated Sandwich Method
• An approximation algorithm of the edge metric dimension problem
• The Seeding Algorithm for Spherical k-Means Clustering with Penalties
• Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes
• Two-Way Currency Trading Algorithms in the Discrete Setting
• Approximation Algorithms for the Minimum Power Partial Cover Problem
• On approximations for constructing required subgraphs using stock pieces of fixed length
• A primal dual approximation algorithm for the multicut problem in trees with submodular penalties
• Algorithm aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs
• Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks
• Locality Sensitive Algotrithms for Data Mule Routing Problem
• Maximize a Monotone Function with a Generic Submodularity Ratio
• Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem
• A general framework for path convexities
• An approximation algorithm for the dynamic k-level facility location problem
• Weighted Two-Dimensional Finite Automata
• Improved Parameterized Algorithms for Mixed Domination
• New Results on the Zero-Visibility Cops and Robber Game
• A two-stage constrained submodular maximization
• Local search approximation algorithms for the spherical k-means problem.