Algorithmic aspects in information and management : 13th International Conference, AAIM 2019, Beijing, China, August 6-8, 2019 : proceedings /: 13th International Conference, AAIM 2019, Beijing, China, August 6-8, 2019 : proceedings. ([2019])

• Record Type: Book
• Further Information: Note: Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang (eds.).
• Editors: Du, Ding-Zhu; Li, Lian; Sun, Xiaoming; Zhang, Jialin
• Other Names: AAIM (Conference), 13th
• Contents: 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.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2019
• Extent: 1 online resource (ix, 354 pages), illustrations (some color)
• Subjects: 005.1; Computer algorithms -- Congresses; Management science -- Data processing -- Congresses; Electronic books
• Languages: English
• ISBNs: 9783030271954; 3030271951
• Related ISBNs: 9783030271947
• Notes: Note: Includes bibliographical references and index.; Note: Online resource; title from PDF title page (SpringerLink, viewed August 29, 2019).
• 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.