Vor Ort
Merkzettel Warenkorb
Produktbild: Algorithmic Aspects in Information and Management
Band 11640

Algorithmic Aspects in Information and Management 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings

Aus der Reihe Theoretical Computer Science and General Issues

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

02.08.2019

Abbildungen

IX, 67 illus., 9 illus. in color., schwarz-weiss Illustrationen, farbige Illustrationen

Herausgeber

Ding-Zhu Du + weitere

Verlag

Springer

Seitenzahl

354

Maße (L/B/H)

23,5/15,5/2 cm

Gewicht

557 g

Auflage

1st ed. 2019

Sprache

Englisch

ISBN

978-3-030-27194-7

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

02.08.2019

Abbildungen

IX, 67 illus., 9 illus. in color., schwarz-weiss Illustrationen, farbige Illustrationen

Herausgeber

Verlag

Springer

Seitenzahl

354

Maße (L/B/H)

23,5/15,5/2 cm

Gewicht

557 g

Auflage

1st ed. 2019

Sprache

Englisch

ISBN

978-3-030-27194-7

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Algorithmic Aspects in Information and Management

  • 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 Scaffold Filling.- Profit Parameterizations of Dominating Set.- Exponential Time Approximation Scheme for TSP.- Interaction-aware Influence 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 constrained cluster 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 Efficient 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.