TOP
0
0
即日起~6/30,暑期閱讀書展,好書7折起
Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20-22, 2021, Proceedings

Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20-22, 2021, Proceedings

商品資訊

定價
:NT$ 4050 元
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
相關商品
商品簡介

商品簡介

Approximation Algorithms.- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations.- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties.- Approximation algorithms for the maximum bounded connected bipartition problem.- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem.- On Stochastic k-Facility Location.- The Complexity of Finding a Broadcast Center.- An Online Algorithm for Data Caching Problem in Edge Computing.- Topical part: Scheduling.- Scheduling on Multiple Two-Stage Flowshops with A Deadline.- Single machine scheduling with rejection to minimize the weighted makespan.- Maximizing Energy Efficiency for Charger Scheduling of WRSNs.- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem.- Optimizing mobile charger scheduling for task-based sensor networks.- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time.- Topical part: Nonlinear Combinatorial Optimization.- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints.- Stochastic Submodular Probing with State-Dependent Costs.- Bi-criteria Adaptive Algorithms for Supermodular Minimization.- Improved Algorithms for Non-submodular Function Maximization Problem.- Fixed Observation Time-step: Adaptive Influence Maximization.- Measured Continuous Greedy with Differential Privacy.- Topical part: Network Problems.- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks.- Multi-attribute based Influence Maximization in Social Networks.- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks.- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement.- Time Sensitive Sweep Coverage with Multiple UAVs.- Recursive Merged Community Detection Algorithm based on Node Cluster.- Purchase Preferences - Based Air Passenger Choice Behavior Analysis from Sales Transaction Data.- Topical part: Blockchain, Logic, Complexity and Reliability.- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph.- Sensitivity-Based Optimization for Blockchain Selfish Mining.- Design and Implementation of List and Dictionary in XD-M Language.- Reliable Edge Intelligence using JPEG Progressive.- A game-theoretic analysis of deep neural networks.- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case.- Topical part: Miscellaneous.- The independence numbers of weighted graphs with forbidden cycles.- Wegner's Conjecture on 2-Distance Coloring.- An Efficient Oracle for Counting Shortest Paths in Planar Graphs.- Restrained and total restrained domination in cographs.- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs.- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge.

您曾經瀏覽過的商品

購物須知

外文書商品之書封,為出版社提供之樣本。實際出貨商品,以出版社所提供之現有版本為主。部份書籍,因出版社供應狀況特殊,匯率將依實際狀況做調整。

無庫存之商品,在您完成訂單程序之後,將以空運的方式為你下單調貨。為了縮短等待的時間,建議您將外文書與其他商品分開下單,以獲得最快的取貨速度,平均調貨時間為1~2個月。

為了保護您的權益,「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。

若要辦理退貨,請在商品鑑賞期內寄回,且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。

定價:100 4050
若需訂購本書,請電洽客服 02-25006600[分機130、131]。

暢銷榜

客服中心

收藏

會員專區