Algorithmic Aspects in Information and Management

12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings

Häftad, Engelska, 2018

Av Shaojie Tang, Ding-Zhu Du, David Woodruff, Sergiy Butenko

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2018-11-17
Mått155 x 235 x 18 mm
Vikt499 g
FormatHäftad
SpråkEngelska
SerieTheoretical Computer Science and General Issues
Antal sidor320
Upplaga18001
FörlagSpringer Nature Switzerland AG
ISBN9783030046170

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Beräkning och matematisk analys inom Naturvetenskap och teknik
Databaser inom Data och it
Artificiell intelligens inom Data och it

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.