標題: Titlebook: Algorithmic Aspects in Information and Management; 18th International C Smita Ghosh,Zhao Zhang Conference proceedings 2024 The Editor(s) (i [打印本頁] 作者: Awkward 時間: 2025-3-21 16:42
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)學科排名
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡公開度
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡公開度學科排名
書目名稱Algorithmic Aspects in Information and Management被引頻次
書目名稱Algorithmic Aspects in Information and Management被引頻次學科排名
書目名稱Algorithmic Aspects in Information and Management年度引用
書目名稱Algorithmic Aspects in Information and Management年度引用學科排名
書目名稱Algorithmic Aspects in Information and Management讀者反饋
書目名稱Algorithmic Aspects in Information and Management讀者反饋學科排名
作者: 獨裁政府 時間: 2025-3-22 00:08
Valerio Sperati,Vito Trianni,Stefano Nolfiaph becomes more complex, for the general network . we consider the problem of inserting a minimum of . edges such that the shortest distances . between a given set of . pairs of points . are all decreased..The main results of this paper are summarized as follows:作者: 尊敬 時間: 2025-3-22 02:19
Cost-Sharing Mechanisms for?the?Selfish Open-End Bin Packing Problemat . does not exceed 2 and . equals to 1 under the Max-OEBP model, and . does not exceed 4 and . does not exceed . under the Min-OEBP model. We also show that the packing scheme output by the FFD algorithm is a Nash equilibrium under both models, which implies that we can output a stable packing scheme in polynomial time under this mechanism.作者: lavish 時間: 2025-3-22 07:33
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constraaph becomes more complex, for the general network . we consider the problem of inserting a minimum of . edges such that the shortest distances . between a given set of . pairs of points . are all decreased..The main results of this paper are summarized as follows:作者: 似少年 時間: 2025-3-22 10:07 作者: detach 時間: 2025-3-22 13:54
Nonlinear Optics: past, present and future,ew pairing. These two Lagrangian subproblems are solved by a branch-and-price algorithm. In the branch-and-price algorithm, we present a heuristic branching strategy. The computational experiments are conducted on several real-world data sets.作者: 匯總 時間: 2025-3-22 17:53
Maximum Core Spanning Tree Insertion Maintenance for?Large Dynamic Graphs MCST maintenance for edge insertion is bounded by ., where . is the edge set whose edge weight changes after insertion. Through extensive evaluations, we show the proposed MCST insertion maintenance algorithm has good efficiency on real-world datasets.作者: KEGEL 時間: 2025-3-22 22:56
Integrated Airline Aircraft Routing and?Crew Pairing by?Alternating Lagrangian Decompositionew pairing. These two Lagrangian subproblems are solved by a branch-and-price algorithm. In the branch-and-price algorithm, we present a heuristic branching strategy. The computational experiments are conducted on several real-world data sets.作者: 運動吧 時間: 2025-3-23 02:15
0302-9743 formation and Management, AAIM 2024, which took place virtually during September 21-23, 2024..The 45 full papers? presented in these two volumes were carefully reviewed and selected from 76 submissions. The papers are organized in the following topical sections:.Part I: Optimization and applications作者: gerrymander 時間: 2025-3-23 09:31
https://doi.org/10.1007/978-3-319-29108-6hm outputs a fractional total dominating set of expected size .. The distributed algorithm runs in . communication rounds, and the algorithm use messages of size .. The fractional solution is then rounded to obtain an integer total dominating set for the original problem.作者: 吃掉 時間: 2025-3-23 10:21 作者: 屈尊 時間: 2025-3-23 14:14
Nonlinear Optics: past, present and future,cepted and all the tasks must be processed and incurs a cost, or rejected which incurs a rejection penalty. Finally, we obtain bi-criteria (., .)-approximation for bag of tasks scheduling problem with rejection by using iterative rounding and linear programming rounding.作者: 省略 時間: 2025-3-23 20:37
A Distributed Approximation Algorithm for?the?Total Dominating Set Problemhm outputs a fractional total dominating set of expected size .. The distributed algorithm runs in . communication rounds, and the algorithm use messages of size .. The fractional solution is then rounded to obtain an integer total dominating set for the original problem.作者: 斷言 時間: 2025-3-23 23:44 作者: 思鄉(xiāng)病 時間: 2025-3-24 03:23
Iterative Rounding for?Bag of?Tasks Scheduling with?Rejection in?High Performance Computingcepted and all the tasks must be processed and incurs a cost, or rejected which incurs a rejection penalty. Finally, we obtain bi-criteria (., .)-approximation for bag of tasks scheduling problem with rejection by using iterative rounding and linear programming rounding.作者: Retrieval 時間: 2025-3-24 10:01
Conference proceedings 2024reviewed and selected from 76 submissions. The papers are organized in the following topical sections:.Part I: Optimization and applications; submodularity, management and others,.Part II: Graphs and networks; quantum and others..作者: 刺穿 時間: 2025-3-24 12:58 作者: 走調 時間: 2025-3-24 16:54 作者: DECRY 時間: 2025-3-24 22:01
Guided Self-Organization: Inceptions, need to move together and that some groups may be more important than others. To address these limitations, we modify the minsum flow problem to support flows represented as discrete and weighted sets. We also propose a 2-approximation pseudo-polynomial time algorithm to solve this modified problem for path networks with uniform capacity.作者: 放肆的我 時間: 2025-3-25 00:26
https://doi.org/10.1007/978-3-642-53734-9oI), which decays over time. Therefore, in this paper, we investigate the UAV Trajectory optimization problem for Maximizing the ToI-based data utility (TMT). We propose an improved deep reinforcement learning-based algorithm to address the problem, and the experience results demonstrate the effectiveness of our designs.作者: chisel 時間: 2025-3-25 04:41
NFTO: DAG-Based Task Offloading and?Energy Optimization Algorithmoading Algorithm based on Network Flow Theory. The core innovation lies in applying network flow theory to optimize task scheduling in dynamic environments, considering service caching and device energy constraints. We validate the algorithm’s advantages through comprehensive simulations.作者: 無底 時間: 2025-3-25 09:39
Minsum Problem for?Discrete and?Weighted Set Flow on?Dynamic Path Networks, need to move together and that some groups may be more important than others. To address these limitations, we modify the minsum flow problem to support flows represented as discrete and weighted sets. We also propose a 2-approximation pseudo-polynomial time algorithm to solve this modified problem for path networks with uniform capacity.作者: 眉毛 時間: 2025-3-25 13:34
ToI-Based Data Utility Maximization for?UAV-Assisted Wireless Sensor NetworksoI), which decays over time. Therefore, in this paper, we investigate the UAV Trajectory optimization problem for Maximizing the ToI-based data utility (TMT). We propose an improved deep reinforcement learning-based algorithm to address the problem, and the experience results demonstrate the effectiveness of our designs.作者: 阻止 時間: 2025-3-25 18:11 作者: jeopardize 時間: 2025-3-25 21:37
Algorithmic Aspects in Information and Management978-981-97-7798-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 倔強一點 時間: 2025-3-26 01:04
ICBT for Severe Health Anxiety,quirement ., the goal of the . (MaxIMC) problem is to find a sub-collection of intervals . with . to maximize the number of fully-covered points, where a point . is fully-covered by . if it belongs to at least . intervals of .. In this paper, we present a .-approximation algorithm for the MaxIMC problem.作者: LEER 時間: 2025-3-26 05:40
https://doi.org/10.1007/978-981-97-7798-3Algorithms and data structures; Algorithmic game theory and incentive analysis; Approximation algorith作者: frivolous 時間: 2025-3-26 12:21 作者: 并入 時間: 2025-3-26 16:38 作者: 貪婪地吃 時間: 2025-3-26 17:25
The Agoras of the Twenty-First Century indicating the “staired coreness hierarchy” in each connected component. The edge weight here is defined as ., and .(.) is the corness of vertex .. Unlike the insertion maintenance problem of Maximum Spanning Tree (MST) which has known efficient algorithms, MCST insertion maintenance raises special作者: 本能 時間: 2025-3-26 22:56
History and Current Status of ICBT,twork edge, reducing latency, and enhancing service reliability. Existing research often inadequately addresses offloading tasks with Directed Acyclic Graph structures and fails to consider the dynamic MEC environment, limiting practical applicability. This paper proposes a DAG Task Computation Offl作者: debble 時間: 2025-3-27 04:46 作者: emulsify 時間: 2025-3-27 07:22
Guided Self-Organization: Inceptionow problem has been widely studied for its relevance in finding evacuation routes during emergencies such as earthquakes. However, previous approaches often assume that individuals are separable and identical, which does not adequately account for the fact that some groups of people, such as familie作者: anchor 時間: 2025-3-27 11:58 作者: ensemble 時間: 2025-3-27 14:38 作者: Lyme-disease 時間: 2025-3-27 19:52
https://doi.org/10.1007/978-3-642-53734-9r networks. Previous works mainly focus on improving the freshness of the collected data or the energy efficiency by scheduling UAVs. Considering the fact that the sensing data in some applications is time-sensitive, that is, the value of the sensing data is based on its Timeliness of Information (T作者: NOT 時間: 2025-3-28 00:48 作者: 出處 時間: 2025-3-28 03:56 作者: 左右連貫 時間: 2025-3-28 06:17 作者: Truculent 時間: 2025-3-28 14:15
https://doi.org/10.1007/978-3-319-29108-6sent a distributed algorithm for the TDS problem via the LP relaxation techniques. For a positive integer . and maximum degree ., the proposed algorithm outputs a fractional total dominating set of expected size .. The distributed algorithm runs in . communication rounds, and the algorithm use messa作者: RACE 時間: 2025-3-28 16:04
https://doi.org/10.1007/978-3-030-75216-3information about all clients is challenging. When client information is provided incrementally, this gives rise to the .. Both the online facility location problem with general facility costs and the one with uniform facility cost have attracted the attention of researchers. In the existing literat作者: Pseudoephedrine 時間: 2025-3-28 20:24 作者: pacifist 時間: 2025-3-29 00:12 作者: Mercurial 時間: 2025-3-29 05:35
Squeezed States using Parametric Processes,ality. A .-cycle partitioning is a set of . vertex-disjoint .-cycles, i.e. cycles containing exactly . vertices (and thus . edges). The minimum weight .-cycle partition problem (MinWkCP) aims to compute a .-cycle partition with minimum total edge weight. The minimum weight .-path partition problem (作者: 外觀 時間: 2025-3-29 08:53 作者: hypnotic 時間: 2025-3-29 14:54 作者: 抱負 時間: 2025-3-29 17:56
Approximation Algorithm for?the?Maximum Interval Multi-cover Problemquirement ., the goal of the . (MaxIMC) problem is to find a sub-collection of intervals . with . to maximize the number of fully-covered points, where a point . is fully-covered by . if it belongs to at least . intervals of .. In this paper, we present a .-approximation algorithm for the MaxIMC problem.作者: amorphous 時間: 2025-3-29 23:44 作者: Feature 時間: 2025-3-30 00:01 作者: glacial 時間: 2025-3-30 04:28
Approximation Algorithm for?the?Maximum Interval Multi-cover Problemquirement ., the goal of the . (MaxIMC) problem is to find a sub-collection of intervals . with . to maximize the number of fully-covered points, where a point . is fully-covered by . if it belongs to at least . intervals of .. In this paper, we present a .-approximation algorithm for the MaxIMC pro作者: Cytokines 時間: 2025-3-30 10:39 作者: GLOOM 時間: 2025-3-30 13:17
Efficient Approximation Algorithms for?Parallel Batch Machine Scheduling of?Malleable JobsPBMS). Unlike traditional PBMS that considers only fixed job widths, this paper studies generalized PBMS with malleable jobs that allow job width to be changed during the job execution, provided it does not exceed its maximum degree of parallelism. We propose a fast . approximation algorithm by exte作者: Handedness 時間: 2025-3-30 19:52 作者: 神刊 時間: 2025-3-30 22:25
ToI-Based Data Utility Maximization for?UAV-Assisted Wireless Sensor Networksr networks. Previous works mainly focus on improving the freshness of the collected data or the energy efficiency by scheduling UAVs. Considering the fact that the sensing data in some applications is time-sensitive, that is, the value of the sensing data is based on its Timeliness of Information (T作者: 肌肉 時間: 2025-3-31 02:25
Parity-Constrained Weighted ,-Center metric space with distances and a non-negative budget .. Additionally, each vertex is associated with a non-negative weight and an odd or even parity requirement. The objective is to select a subset of vertices as open centers and assign each vertex to an open center so as to minimize the maximum d作者: 定點 時間: 2025-3-31 05:03
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constra, which is called the diameter of?.. Given a disconnected road network modelled as two disjoint trees . and ., this paper first aims at inserting one or two edges (bridges) between them to minimize the (constrained) diameter . going through the inserted edges, where ., is the set of inserted edges w作者: EVEN 時間: 2025-3-31 09:36 作者: 吞噬 時間: 2025-3-31 16:39
A Distributed Approximation Algorithm for?the?Total Dominating Set Problemsent a distributed algorithm for the TDS problem via the LP relaxation techniques. For a positive integer . and maximum degree ., the proposed algorithm outputs a fractional total dominating set of expected size .. The distributed algorithm runs in . communication rounds, and the algorithm use messa作者: pulse-pressure 時間: 2025-3-31 18:46 作者: candle 時間: 2025-4-1 01:01
or-Submodular Maximization Under a?Matroid Constraint and?a?Knapsack Constraintg an or-submodular function under different constraints arises in many applications, and it is NP-hard. In this paper, we utilize a greedy algorithm to get a .-approximation solution for maximizing an or-submodular function under a matroid constraint. Moreover, for maximizing an or-submodular functi作者: 使尷尬 時間: 2025-4-1 02:23
