Del 11640 i serien Lecture Notes in Computer Science

Algorithmic Aspects in Information and Management

13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings

Häftad, Engelska, 2019

AvDing-Zhu Du,Lian Li,Xiaoming Sun,Jialin Zhang

729 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 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019.The 31 full papers presented were carefully reviewed and selected. The papers deal with most aspects of theoretical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications.

Produktinformation

Utgivningsdatum2019-08-02
Mått155 x 235 x 22 mm
Vikt552 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor354
FörlagSpringer Nature Switzerland AG
ISBN9783030271947

Tillhör följande kategorier

One-Dimensional r -Gathering under Uncertainty.- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees.- A Probabilistic Algorithm for Veriﬁcation of Geometric Theorems.- Approximating Closest Vector Problem in inﬁnte 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 Scaﬀold Filling.- Proﬁt Parameterizations of Dominating Set.- Exponential Time Approximation Scheme for TSP.- Interaction-aware Inﬂuence 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 constrainedcluster 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 ﬁxed 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 Eﬃcient 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.

Du kanske också är intresserad av

Theoretical Computer Science

Dingzhu Du, Lian Li, En Zhu, Kun He

Häftad, 2017

749 kr

Theoretical Computer Science

Minming Li, Jialin Zhang, Zhiping Cai

Häftad, 2025

1 039 kr

Theoretical Computer Science

Lian Li, Pinyan Lu, Kun He

Häftad, 2018

749 kr

Computational Thinking: A Perspective on Computer Science

Zhiwei Xu, Jialin Zhang

Inbunden, 2021

969 kr

Theoretical Computer Science

Zhiping Cai, Mingyu Xiao, Jialin Zhang

Häftad, 2023

1 109 kr

Theoretical Computer Science

Zhiping Cai, Yijia Chen, Jialin Zhang

Häftad, 2022

1 109 kr

Information-Sharing in einer Supply Chain

Lian Li

Häftad, 2006

3 099 kr

Quantum Computation

Xiaoyu Li, Junjie Wu, Jialin Zhang

Häftad, 2026

1 259 kr

Advanced Computer Architecture

Junjie Wu, Lian Li

Häftad, 2016

749 kr

Theoretical Computer Science

Zhiping Cai, Jian Li, Jialin Zhang

Häftad, 2021

1 109 kr

Del 11640 i serien Lecture Notes in Computer Science

Algorithmic Aspects in Information and Management

13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings

Häftad, Engelska, 2019

AvDing-Zhu Du,Lian Li,Xiaoming Sun,Jialin Zhang

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum2019-08-02
Mått155 x 235 x 22 mm
Vikt552 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor354
FörlagSpringer Nature Switzerland AG
ISBN9783030271947

Tillhör följande kategorier

One-Dimensional r -Gathering under Uncertainty.- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees.- A Probabilistic Algorithm for Veriﬁcation of Geometric Theorems.- Approximating Closest Vector Problem in inﬁnte 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 Scaﬀold Filling.- Proﬁt Parameterizations of Dominating Set.- Exponential Time Approximation Scheme for TSP.- Interaction-aware Inﬂuence 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 constrainedcluster 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 ﬁxed 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 Eﬃcient 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.