| Description |
1 online resource (viii, 320 pages) : illustrations (some color) |
| Series |
Lecture notes in computer science ; 11343 |
|
LNCS sublibrary, SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 11343.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
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 |
| Summary |
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 |
| Notes |
International conference proceedings |
|
Includes author index |
|
Online resource; title from PDF title page (SpringerLink, viewed December 3, 2018) |
| Subject |
Computer algorithms -- Congresses
|
|
Management science -- Data processing -- Congresses
|
|
Algorithms & data structures.
|
|
Mathematical theory of computation.
|
|
Artificial intelligence.
|
|
Discrete mathematics.
|
|
Computers -- Programming -- Algorithms.
|
|
Computers -- Intelligence (AI) & Semantics.
|
|
Computers -- Data Modeling & Design.
|
|
Computers -- Data Processing.
|
|
Computer algorithms
|
|
Management science -- Data processing
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Tang, Shaojie, editor
|
|
Du, Ding-Zhu, editor
|
|
Woodruff, David, editor
|
|
Butenko, Sergiy, editor.
|
| ISBN |
9783030046187 |
|
3030046184 |
|
