Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmic Aspects in Information and Management: 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings de Shaojie Tang

Algorithmic Aspects in Information and Management: 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings: Lecture Notes in Computer Science, cartea 11343

Editat de Shaojie Tang, Ding-Zhu Du, David Woodruff, Sergiy Butenko
en Limba Engleză Paperback – 17 noi 2018
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32734 lei

Preț vechi: 40917 lei
-20% Nou

Puncte Express: 491
Preț estimativ în valută:
6265€ • 6573$ • 5197£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030046170
ISBN-10: 3030046176
Pagini: 304
Ilustrații: VIII, 320 p. 77 illus., 31 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.46 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.