標(biāo)題: Titlebook: Approximation and Online Algorithms; 20th International W Parinya Chalermsook,Bundit Laekhanukit Conference proceedings 2022 The Editor(s) [打印本頁] 作者: choleric 時間: 2025-3-21 16:07
書目名稱Approximation and Online Algorithms影響因子(影響力)
書目名稱Approximation and Online Algorithms影響因子(影響力)學(xué)科排名
書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度
書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Approximation and Online Algorithms被引頻次
書目名稱Approximation and Online Algorithms被引頻次學(xué)科排名
書目名稱Approximation and Online Algorithms年度引用
書目名稱Approximation and Online Algorithms年度引用學(xué)科排名
書目名稱Approximation and Online Algorithms讀者反饋
書目名稱Approximation and Online Algorithms讀者反饋學(xué)科排名
作者: 舊石器時代 時間: 2025-3-21 23:17 作者: PON 時間: 2025-3-22 01:41 作者: 假裝是你 時間: 2025-3-22 07:38
Knapsack Secretary Through Boosting,ent sizes and multiple items may be selected if their total size does not exceed the capacity . of a knapsack. Previous works show competitive ratios of 1/(10.) (Babaioff et al.), 1/8.06 (Kesselheim et al.; STOC 2014), and 1/6.65 (Albers, Khan, and Ladewig; APPROX?2019) for the general problem but n作者: CRAFT 時間: 2025-3-22 11:58 作者: POWER 時間: 2025-3-22 13:59 作者: 有說服力 時間: 2025-3-22 18:59 作者: HUMP 時間: 2025-3-22 23:32
,An Improved Algorithm for?Open Online Dial-a-Ride,r. The objective is to minimize the completion time until all requests have been served. We present a new, parameterized algorithm for this problem and prove that it attains a competitive ratio of . for some choice of its parameter, where . is the golden ratio. This improves the best known bounds fo作者: 偏見 時間: 2025-3-23 04:15
,Stochastic Graph Exploration with?Limited Resources, network data sets. Specifically, exploration of social networks constitutes a growing field of research, as they generate a huge amount of data on a daily basis and are the main tool for networking, communications, and content sharing. Exploring these networks is resource-consuming (time, money, en作者: squander 時間: 2025-3-23 09:37
,Adaptivity Gaps for?the?Stochastic Boolean Function Evaluation Problem,wn bit string . of length .. We determine .(.) by sequentially testing the variables of ., each of which is associated with a cost of testing and an independent probability of being true. If a strategy for solving the problem is adaptive in the sense that its next test can depend on the outcomes of 作者: Between 時間: 2025-3-23 11:59 作者: OTHER 時間: 2025-3-23 14:18 作者: RENAL 時間: 2025-3-23 18:41
Die Behandlung des kindlichen Empyems,re various approximation algorithms that provide a trade-off between the approximation factor and the running time. Our approximation algorithms have a running time with only linear dependency on the number of input sequences. In addition, we use our mean algorithms to obtain clustering algorithms with theoretical guarantees.作者: Pageant 時間: 2025-3-24 00:11 作者: 招人嫉妒 時間: 2025-3-24 03:47
0302-9743 imation and Online Algorithms, WAOA 2022, which was colocated with ALGO 2022 and took place in Potsdam, Germany, in September 2022..The 12 papers included in these proceedings were carefully reviewed and selected from.21 submissions. They focus on topics such as graph algorithms, network design, alg作者: vocation 時間: 2025-3-24 07:26
,Nicotinwirkungen und -Sch?digungen,niform .-center problem to be in XP when parameterized by the number of different radii and the treewidth of the graph. This extends the known exactly solvable cases of the non-uniform .-center problem; in particular this also solves the .-center with outliers on graphs of small treewidth exactly.作者: 鉗子 時間: 2025-3-24 14:44
Poliomyelitis-Epidemien auf Inseln,d prove that it attains a competitive ratio of . for some choice of its parameter, where . is the golden ratio. This improves the best known bounds for open online dial-a-ride both for general metric spaces as well as for the real line. We also give a lower bound of?2.457 for the competitive ratio of our algorithm for any parameter choice.作者: Confidential 時間: 2025-3-24 14:50
,Graph Burning and?Non-uniform ,-centers for?Small Treewidth,niform .-center problem to be in XP when parameterized by the number of different radii and the treewidth of the graph. This extends the known exactly solvable cases of the non-uniform .-center problem; in particular this also solves the .-center with outliers on graphs of small treewidth exactly.作者: Fulsome 時間: 2025-3-24 21:10 作者: NEG 時間: 2025-3-25 02:10 作者: neurologist 時間: 2025-3-25 04:34 作者: 沒有貧窮 時間: 2025-3-25 10:36
0302-9743 uded in these proceedings were carefully reviewed and selected from.21 submissions. They focus on topics such as graph algorithms, network design, algorithmic game theory, approximation and online algorithms, etc..978-3-031-18366-9978-3-031-18367-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: judicial 時間: 2025-3-25 12:44 作者: 啞劇 時間: 2025-3-25 17:26
,Nicotinwirkungen und -Sch?digungen,ly extends the previous results, as a PTAS was known only for disjoint union of paths..As a building block, we give an algorithm that proves the non-uniform .-center problem to be in XP when parameterized by the number of different radii and the treewidth of the graph. This extends the known exactly作者: 流逝 時間: 2025-3-25 22:46
,Sp?tergebnisse operierter Mitralstenosen,st-processing of tasks or spatial restrictions. In this context, each job has a blocking time before and after its processing time, i.e., three parameters. Given a set of jobs, a set of machines, and a graph representing machine conflicts, the problem .?(.), asks for a conflict-free schedule of mini作者: frozen-shoulder 時間: 2025-3-26 02:51
,Sp?tergebnisse operierter Mitralstenosen,ent sizes and multiple items may be selected if their total size does not exceed the capacity . of a knapsack. Previous works show competitive ratios of 1/(10.) (Babaioff et al.), 1/8.06 (Kesselheim et al.; STOC 2014), and 1/6.65 (Albers, Khan, and Ladewig; APPROX?2019) for the general problem but n作者: VAN 時間: 2025-3-26 06:04
L. Heilmeyer,R. Schoen,B. Rudderred decision making. Specifically, it allows for the problem to be split into an online phase where a stream of appointment requests arrive requiring a scheduled time, followed by an offline phase where those appointments are scheduled into rooms. Similar to the bin-packing problem, the aim is to us作者: lymphoma 時間: 2025-3-26 10:49 作者: 蔑視 時間: 2025-3-26 14:55 作者: Cerumen 時間: 2025-3-26 18:47 作者: Lacunar-Stroke 時間: 2025-3-26 21:13 作者: Preserve 時間: 2025-3-27 01:16
https://doi.org/10.1007/978-3-642-90644-2wn bit string . of length .. We determine .(.) by sequentially testing the variables of ., each of which is associated with a cost of testing and an independent probability of being true. If a strategy for solving the problem is adaptive in the sense that its next test can depend on the outcomes of 作者: malign 時間: 2025-3-27 07:10 作者: Sleep-Paralysis 時間: 2025-3-27 12:26
Die Behandlung des kindlichen Empyems, our setting we are given a set of finite point sequences over an arbitrary metric space and we want to compute a mean point sequence of given length that minimizes the sum of .-DTW distances, each raised to the . power, between the input sequences and the mean sequence. In general, the problem is .作者: 乏味 時間: 2025-3-27 17:17
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/160428.jpg作者: 陶瓷 時間: 2025-3-27 18:10
Approximation and Online Algorithms978-3-031-18367-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Fatten 時間: 2025-3-27 22:38 作者: follicular-unit 時間: 2025-3-28 04:11 作者: 忘川河 時間: 2025-3-28 07:53 作者: prolate 時間: 2025-3-28 11:45
,Sp?tergebnisse operierter Mitralstenosen, to solve the problem for the case of unit jobs . on special graph classes. As our main result, we solve . for bipartite graphs by using structural insights for conflict graphs of star forests. As the set of active machines at each point in time induces a bipartite graph, the insights yield a local 作者: ITCH 時間: 2025-3-28 16:28
,Sp?tergebnisse operierter Mitralstenosen,ecretary problem towards the knapsack secretary problem. Our algorithm is simple: It . the value of size-1 items by a factor . and then uses the size-oblivious approach by Albers, Khan, and Ladewig. We show by a nontrivial analysis that this algorithm achieves a competitive ratio of 1/. if and only 作者: Fabric 時間: 2025-3-28 20:26 作者: 出生 時間: 2025-3-29 00:58 作者: 本土 時間: 2025-3-29 06:02 作者: 幼稚 時間: 2025-3-29 10:54 作者: 精美食品 時間: 2025-3-29 12:53
https://doi.org/10.1007/978-3-642-90644-2 popular classes of Boolean functions, including read-once DNF formulas, read-once formulas, and general DNFs. Our bounds range from . to ., contrasting with recent .(1) gaps shown for symmetric functions and linear threshold functions.作者: 推延 時間: 2025-3-29 18:07
https://doi.org/10.1007/978-3-642-90644-2stant-factor approximation algorithm using less than a linear number of bits even for unit intervals. On the positive side we show that the maximum geometric independent set in a set of axis-aligned unit-height rectangles can be 4-approximated using only . bits.作者: THROB 時間: 2025-3-29 21:30
,Locating Service and?Charging Stations,o locate the facilities such that each client can follow its path without any detours. For both problems, our objective is to minimize the number of charging stations..For all three problems, when the underlying graph is a tree and the facility can be located at any vertex on the tree, we show that 作者: 改革運動 時間: 2025-3-30 00:33
,Scheduling with?Machine Conflicts, to solve the problem for the case of unit jobs . on special graph classes. As our main result, we solve . for bipartite graphs by using structural insights for conflict graphs of star forests. As the set of active machines at each point in time induces a bipartite graph, the insights yield a local 作者: 藐視 時間: 2025-3-30 04:32 作者: 教育學(xué) 時間: 2025-3-30 11:26
,Scheduling Appointments Online: The Power of?Deferred Decision-Making,lly different from the online bin-packing problem. Our main contribution is to develop a new randomized algorithm for the problem that achieves an asymptotic competitive ratio under 1.455, indicating the potential for further progress. This improvement is attained by modifying the process for schedu作者: Bernstein-test 時間: 2025-3-30 13:00
,Canadian Traveller Problem with?Predictions,eoff between consistency and robustness is optimal, and show a lower bound for the randomized algorithm. Finally, we prove several deterministic and randomized lower bounds on the competitive ratio of .-CTP depending on the prediction error, and complement them, in most cases, with matching upper bo作者: 微粒 時間: 2025-3-30 18:42 作者: chuckle 時間: 2025-3-30 23:00 作者: 聲音刺耳 時間: 2025-3-31 03:33 作者: 柱廊 時間: 2025-3-31 08:47
