標(biāo)題: Titlebook: Algorithmic Aspects in Information and Management; 16th International C Qiufen Ni,Weili Wu Conference proceedings 2022 The Editor(s) (if ap [打印本頁] 作者: VIRAL 時間: 2025-3-21 16:36
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management被引頻次
書目名稱Algorithmic Aspects in Information and Management被引頻次學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management年度引用
書目名稱Algorithmic Aspects in Information and Management年度引用學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management讀者反饋
書目名稱Algorithmic Aspects in Information and Management讀者反饋學(xué)科排名
作者: UNT 時間: 2025-3-21 22:45
An Approximation Algorithm for?the?Clustered Path Travelling Salesman Problemg the triangle inequality. In addition, the vertex set . is partitioned into clusters .. The objective of the problem is to find a minimum Hamiltonian path in ., and in the path all vertices of each cluster are visited consecutively. We provide a polynomial-time approximation algorithm for the probl作者: FEIGN 時間: 2025-3-22 03:21 作者: cunning 時間: 2025-3-22 04:50 作者: 兒童 時間: 2025-3-22 11:03 作者: ingrate 時間: 2025-3-22 14:56
The Optimal Dynamic Rationing Policy in?the?Stock-Rationing Queueic solution for the optimal dynamic rationing policy. To do this, we establish a policy-based birth-death process to show that the optimal dynamic rationing policy must be of transformational threshold type. Based on this finding, we can refine three sufficient conditions under each of which the opt作者: 犬儒主義者 時間: 2025-3-22 19:42 作者: Embolic-Stroke 時間: 2025-3-22 23:57
Obnoxious Facility Location Games with?Candidate Locationsive, we present a group strategy-proof mechanism with approximation ratio of 3. Then we prove the ratio is tight by giving a corresponding lower bound instance. This is also proved to be the best possible mechanism. For obnoxious two-facility location games with facility candidate locations, we stud作者: chandel 時間: 2025-3-23 02:28
Streaming Adaptive Submodular Maximizationield focus on pool-based setting, where one can pick items in any order, and there have been few studies for the stream-based setting where items arrive in an arbitrary order and one must immediately decide whether to select an item or not upon its arrival. In this paper, we introduce a new class of作者: Watemelon 時間: 2025-3-23 08:09
Constrained Stochastic Submodular Maximization with?State-Dependent Costsems whose states (i.e., the marginal contribution and the cost of an item) are drawn from a known probability distribution. The only way to know the realized state of an item is to select that item. We consider two constraints, i.e., . and . constraints. Recall that each item has a state-dependent c作者: Coordinate 時間: 2025-3-23 13:18
Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function important role in many applications. In recent years, the problem of maximizing a non-negative monotone submodular function minus a linear function under various constraints has gradually emerged and is widely used in many practical scenarios such as team formation and recommendation. In this paper,作者: 平 時間: 2025-3-23 16:41
Monotone ,-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithmr function, where the input consists of . disjoint subsets, instead of a single subset. For the problem under a knapsack constraint, we consider the algorithm that returns the better solution between the single element of highest value and the result of the fully greedy algorithm, to which we refer 作者: Limited 時間: 2025-3-23 21:50
Guarantees for Maximization of ,-Submodular Functions with a Knapsack and a Matroid Constrainte apply a greedy and local search technique to obtain a .-approximate algorithm for the problem of maximizing a .-submodular function subject to the intersection of a knapsack constraint and a matroid constraint. Furthermore, we use a special analytical method to improve the approximation ratio to .作者: 犬儒主義者 時間: 2025-3-23 22:37
Defense of Scapegoating Attack in Network Tomographymake all the links in the network be identifiable. This requires very high monitoring cost. To overcome this problem, this paper proposes a diagnosis-based defending scheme for scapegoating attack. A scapegoating attack can be launched only when the link set manipulated by the attacker cuts the prob作者: PATHY 時間: 2025-3-24 03:49
An Approximation Algorithm for?the?Clustered Path Travelling Salesman Problemg the triangle inequality. In addition, the vertex set . is partitioned into clusters .. The objective of the problem is to find a minimum Hamiltonian path in ., and in the path all vertices of each cluster are visited consecutively. We provide a polynomial-time approximation algorithm for the problem.作者: Anthropoid 時間: 2025-3-24 06:39 作者: 乞討 時間: 2025-3-24 11:57
Guarantees for Maximization of ,-Submodular Functions with a Knapsack and a Matroid Constrainte apply a greedy and local search technique to obtain a .-approximate algorithm for the problem of maximizing a .-submodular function subject to the intersection of a knapsack constraint and a matroid constraint. Furthermore, we use a special analytical method to improve the approximation ratio to ., when the .-submodular function is monotone.作者: 注射器 時間: 2025-3-24 16:30 作者: 廣大 時間: 2025-3-24 22:27 作者: BILK 時間: 2025-3-25 02:03
978-3-031-16080-6The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: Ventricle 時間: 2025-3-25 04:53 作者: 用樹皮 時間: 2025-3-25 08:48
,Denkm?ler erhalten und ver?ndern,g the triangle inequality. In addition, the vertex set . is partitioned into clusters .. The objective of the problem is to find a minimum Hamiltonian path in ., and in the path all vertices of each cluster are visited consecutively. We provide a polynomial-time approximation algorithm for the probl作者: 亞麻制品 時間: 2025-3-25 15:41 作者: allergy 時間: 2025-3-25 16:57
Denkmalschutz: Genehmigungsverfahren,vailable, we propose an optimal online algorithm with a competitive ratio of .. If we are allowed to reassign at most . jobs after all the jobs have been scheduled, we propose an optimal online algorithm with a competitive ratio of ..作者: novelty 時間: 2025-3-25 20:03
https://doi.org/10.1007/978-3-658-42828-0machine and a sequence of jobs that arrive on-line and must be immediately and irrevocably either assigned on the machine or rejected. The objective is to minimize the sum of the makespan of the accepted jobs and the penalty of the rejected jobs which is determined by a submodular function. We prove作者: 揮舞 時間: 2025-3-26 01:03
https://doi.org/10.1007/978-3-322-98850-8ic solution for the optimal dynamic rationing policy. To do this, we establish a policy-based birth-death process to show that the optimal dynamic rationing policy must be of transformational threshold type. Based on this finding, we can refine three sufficient conditions under each of which the opt作者: 鍵琴 時間: 2025-3-26 05:56 作者: 創(chuàng)造性 時間: 2025-3-26 09:27
https://doi.org/10.1007/978-3-658-18398-1ive, we present a group strategy-proof mechanism with approximation ratio of 3. Then we prove the ratio is tight by giving a corresponding lower bound instance. This is also proved to be the best possible mechanism. For obnoxious two-facility location games with facility candidate locations, we stud作者: Ceramic 時間: 2025-3-26 13:23
,Betrachtungen über das Flugproblem,ield focus on pool-based setting, where one can pick items in any order, and there have been few studies for the stream-based setting where items arrive in an arbitrary order and one must immediately decide whether to select an item or not upon its arrival. In this paper, we introduce a new class of作者: 放牧 時間: 2025-3-26 18:22
,Betrachtungen über das Flugproblem,ems whose states (i.e., the marginal contribution and the cost of an item) are drawn from a known probability distribution. The only way to know the realized state of an item is to select that item. We consider two constraints, i.e., . and . constraints. Recall that each item has a state-dependent c作者: endarterectomy 時間: 2025-3-26 22:35
,Schichtbildungen in der Atmosph?re,important role in many applications. In recent years, the problem of maximizing a non-negative monotone submodular function minus a linear function under various constraints has gradually emerged and is widely used in many practical scenarios such as team formation and recommendation. In this paper,作者: 痛恨 時間: 2025-3-27 03:59
Die Entwicklung des Tierfluges,r function, where the input consists of . disjoint subsets, instead of a single subset. For the problem under a knapsack constraint, we consider the algorithm that returns the better solution between the single element of highest value and the result of the fully greedy algorithm, to which we refer 作者: 腐敗 時間: 2025-3-27 09:19 作者: 刪除 時間: 2025-3-27 10:33
Karl Schaechterle,Louis Wintergerstmake all the links in the network be identifiable. This requires very high monitoring cost. To overcome this problem, this paper proposes a diagnosis-based defending scheme for scapegoating attack. A scapegoating attack can be launched only when the link set manipulated by the attacker cuts the prob作者: 看法等 時間: 2025-3-27 16:19
,Denkm?ler erhalten und ver?ndern,We present a .–approximation algorithm for the asymmetric prize-collecting traveling salesman problem. This is obtained by combining a randomized variant of a rounding algorithm of N.H. Nguyen and T.T. Nguyen [.] and a primal-dual algorithm of N.H. Nguyen [.].作者: MOTIF 時間: 2025-3-27 19:51
Improved Approximation Algorithm for?the?Asymmetric Prize-Collecting TSPWe present a .–approximation algorithm for the asymmetric prize-collecting traveling salesman problem. This is obtained by combining a randomized variant of a rounding algorithm of N.H. Nguyen and T.T. Nguyen [.] and a primal-dual algorithm of N.H. Nguyen [.].作者: 潔凈 時間: 2025-3-27 21:58 作者: 中古 時間: 2025-3-28 02:45
Algorithmic Aspects in Information and Management978-3-031-16081-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Sputum 時間: 2025-3-28 10:20 作者: Phonophobia 時間: 2025-3-28 13:45 作者: 尊嚴(yán) 時間: 2025-3-28 14:49 作者: 剝削 時間: 2025-3-28 19:53
On-line Single Machine Scheduling with?Release Dates and?Submodular Rejection Penalties that there is no on-line algorithm with a constant competitive ratio if the penalty submodular function is nonmonotone. When the penalty submodular function is monotone, we present an on-line algorithm with a competitive ratio 3.作者: In-Situ 時間: 2025-3-29 00:56
Monotone ,-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithmas Greedy+Singleton, and prove an approximation ratio .. Though this ratio is strictly smaller than the best known factor for this problem, Greedy+Singleton is simple, fast, and of special interests. Our experiments demonstrates that the algorithm performs well in terms of the solution quality.作者: TATE 時間: 2025-3-29 03:56 作者: Influx 時間: 2025-3-29 08:31
https://doi.org/10.1007/978-3-322-98850-8eference policy. Finally, we use numerical examples to verify computability of our theoretical results. We believe that the methodology and results developed in this paper can shed light on the study of stock-rationing queue and open a series of potentially promising research.作者: Multiple 時間: 2025-3-29 14:49
,Betrachtungen über das Flugproblem,less of their states. Our objective is to maximize the objective function subject to both inner and outer constraints. Under the assumption that larger cost indicates larger “utility”, we present a constant approximate solution to this problem.作者: 暫時中止 時間: 2025-3-29 18:22
,Schichtbildungen in der Atmosph?re,m in a noisy environment for the first time. In addition, our study will be conducted under two situations, that is, the cardinality constraint and the matroid constraint. Based on these two situations, we propose two bicriteria approximation algorithms respectively and all these algorithms can obtain good results.作者: JOT 時間: 2025-3-29 21:50
Approximation Scheme for?Single-Machine Rescheduling with?Job Delay and?Rejectionnded by a given threshold and the sum of the following three components: the total weighted tardiness time, the total rejection cost, and the maximum tardiness for the accepted jobs, is minimized. We present a pseudo-polynomial time dynamic programming algorithm, and a fully polynomial time approximation scheme.作者: 不透氣 時間: 2025-3-30 02:08
The Optimal Dynamic Rationing Policy in?the?Stock-Rationing Queueeference policy. Finally, we use numerical examples to verify computability of our theoretical results. We believe that the methodology and results developed in this paper can shed light on the study of stock-rationing queue and open a series of potentially promising research.作者: apropos 時間: 2025-3-30 07:41
Constrained Stochastic Submodular Maximization with?State-Dependent Costsless of their states. Our objective is to maximize the objective function subject to both inner and outer constraints. Under the assumption that larger cost indicates larger “utility”, we present a constant approximate solution to this problem.作者: 態(tài)度暖昧 時間: 2025-3-30 12:11
Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function m in a noisy environment for the first time. In addition, our study will be conducted under two situations, that is, the cardinality constraint and the matroid constraint. Based on these two situations, we propose two bicriteria approximation algorithms respectively and all these algorithms can obtain good results.作者: 喚起 時間: 2025-3-30 16:03
0302-9743 nt due to the COVID-19 pandemic..The 41 regular papers included in this book were carefully reviewed and selected from 59 submissions.?.978-3-031-16080-6978-3-031-16081-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Euthyroid 時間: 2025-3-30 18:10
https://doi.org/10.1007/978-3-658-42828-0 that there is no on-line algorithm with a constant competitive ratio if the penalty submodular function is nonmonotone. When the penalty submodular function is monotone, we present an on-line algorithm with a competitive ratio 3.作者: 有偏見 時間: 2025-3-30 23:14 作者: pester 時間: 2025-3-31 01:30
0302-9743 which was held online during August 13-14, 2022. The conference was originally planned to take place in?Guangzhou,?China, but changed to a virtual event due to the COVID-19 pandemic..The 41 regular papers included in this book were carefully reviewed and selected from 59 submissions.?.978-3-031-1608作者: 使絕緣 時間: 2025-3-31 05:36
https://doi.org/10.1007/978-3-658-18398-1 instance. This is also proved to be the best possible mechanism. For obnoxious two-facility location games with facility candidate locations, we study the heterogeneous facility case in this paper. We design a group strategy-proof mechanism and prove that the approximation ratio is 2. We also prove that the problem lower bound is ..
