Algorithmic Aspects in Information and Management
Springer International Publishing (Verlag)
978-3-030-27194-7 (ISBN)
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 computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications.
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 Sca old Filling.- Profit Parameterizations of Dominating Set.- Exponential Time Approximation Scheme for TSP.- Interaction-aware In uence 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 constrainedcluster 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 E cient 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.
| Erscheinungsdatum | 03.08.2019 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | IX, 354 p. 67 illus., 9 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 557 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik | |
| Schlagworte | Algorithm analysis and problem complexity • analysis of algorithms • Applications • approximation algorithms • Clustering • Computer Science • conference proceedings • Data Mining • data structures • graph theory • Informatics • Problem Solving • Research • sensors • Social Networks • theoretical computer science |
| ISBN-10 | 3-030-27194-3 / 3030271943 |
| ISBN-13 | 978-3-030-27194-7 / 9783030271947 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
