Algorithmic Aspects in Information and Management
Springer International Publishing (Verlag)
9783030046170 (ISBN)
This volume constitutes the proceedings of the 12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018, held in Dallas, Texas, USA, in December 2018.
The 25 full papers presented were carefully reviewed and selected. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.
Minimum Diameter $k$-Steiner Forest.- Factors Impacting the Label Denoising of Neural Relation Extraction.- Makespan Minimization on Unrelated Parallel Machines with a Few Bags.- Channel Assignment with r-Dynamic Coloring.- Profit Maximization Problem with Coupons in Social Networks.- A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem.- A Novel Approach to Verifying Context Free Properties of Programs.- Determination of Dual Distances for a Kind of Perfect Mixed Codes.- Approximation and Competitive Algorithms for Single-Minded Selling Problem.- An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints.- Quality-aware Online Task Assignment Using Latent Topic Model.- Calibration Scheduling with Time Slot Cost.- The k-power domination problem in weighted trees.- General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach.- A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTE-A Network.- Faster Compression of Patterns to Rectangle Rule Lists.- Algorithm Designs for Dynamic Ridesharing System.- New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems.- Computation of Kullback-Leibler Divergence between Labeled Stochastic Systems with Non-Identical State Spaces.- Order preserving barrier coverage with weighted sensors on a line.- Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing.- Approximation algorithms and a hardness result for the three-machine proportionate mixed-shop problem.- A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory.- Community-based Acceptance Probability Maximization for Target Users on Social Networks.- Knowledge Graph Embedding Based on Subgraph-aware Proximity.
| Erscheinungsdatum | 18.11.2018 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | VIII, 320 p. 77 illus., 31 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 504 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik | |
| Schlagworte | Algorithm analysis and problem complexity • Applications • approximation algorithms • Artificial Intelligence • Computer Networks • Computer Science • conference proceedings • data structures • graph theory • Heuristic Algorithms • Heuristic Methods • Informatics • Model Checking • Operation Research • Optimization • Problem Solving • Research • Semantics • Social Networks • telecommunication traffic • theoretical computer science |
| ISBN-13 | 9783030046170 / 9783030046170 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
