標(biāo)題: Titlebook: Approximation and Online Algorithms; 21st International W Jaros?aw Byrka,Andreas Wiese Conference proceedings 2023 The Editor(s) (if applic [打印本頁] 作者: intrinsic 時(shí)間: 2025-3-21 20:02
書目名稱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é)科排名
作者: BIBLE 時(shí)間: 2025-3-21 23:57
,A Frequency-Competitive Query Strategy for?Maintaining Low Collision Potential Among Moving Entitieon one another at a fixed time if their separation is less than some specified threshold. Encroachment, of concern in many settings such as collision avoidance, may be unavoidable. However, the associated difficulties are compounded if there is uncertainty about the precise location of entities, giv作者: gonioscopy 時(shí)間: 2025-3-22 01:09
,Approximating Maximum Edge 2-Coloring by?Normalizing Graphs,rs. The problem maximum edge 2-coloring (.) is to find an edge 2-coloring in a graph . with the goal to . the number of colors. For a relevant graph class, . models anti-Ramsey numbers and it was considered in network applications. For the problem a 2-approximation algorithm is known, and if the inp作者: Endearing 時(shí)間: 2025-3-22 07:43
,An Improved Deterministic Algorithm for?the?Online Min-Sum Set Cover Problem,thm has to maintain the time-varying permutation of the list of . elements, and serve a sequence of requests .. Each . is a subset of elements of cardinality at most?.. For a requested set ., an online algorithm has to pay the cost equal to the position of the first element from . on its list. Then,作者: Obligatory 時(shí)間: 2025-3-22 10:13
Greedy Minimum-Energy Scheduling,dividual release times, deadlines, and processing volumes must be scheduled across . parallel processors while minimizing the consumed energy. When idle, each processor can be turned off to save energy, while turning it on requires a fixed amount of energy. For the special case of a single processor作者: ironic 時(shí)間: 2025-3-22 13:58
,Scheduling with?Speed Predictions,the context of scheduling, very recent work has leveraged machine-learned predictions to design algorithms that achieve improved approximation ratios in settings where the processing times of the jobs are initially unknown. In this paper, we study the speed-robust scheduling problem where the speeds作者: 真實(shí)的你 時(shí)間: 2025-3-22 19:46
,The Power of?Amortization on?Scheduling with?Explorable Uncertainty,entially reduced by testing the job, which also takes time. The objective is to schedule all jobs on a single machine with a minimum total completion time. The challenge lies in deciding which jobs to test and the order of testing/processing jobs..The online problem was first introduced with unit te作者: 紳士 時(shí)間: 2025-3-22 23:42 作者: meditation 時(shí)間: 2025-3-23 02:19 作者: APNEA 時(shí)間: 2025-3-23 06:55 作者: Encoding 時(shí)間: 2025-3-23 11:49 作者: fleeting 時(shí)間: 2025-3-23 14:21 作者: 輕浮思想 時(shí)間: 2025-3-23 21:03
Any-Order Online Interval Selection,lgorithm must output a set of non-conflicting intervals. Traditionally in scheduling theory, it is assumed that intervals arrive in order of increasing start times. We drop that assumption and allow for intervals to arrive in any possible order. We call this variant . (AOIS). We assume that some onl作者: burnish 時(shí)間: 2025-3-24 01:22 作者: Generalize 時(shí)間: 2025-3-24 04:37
,Independent Set in?,-Claw-Free Graphs: Conditional ,-Boundedness and?the?Power of?LP/SDP Relaxationimating the maximum-weight independent set in this graph class. For the extremal question, we consider the notion, that we call . .-. of a graph: Given a graph . that is assumed to contain an independent set of a certain (constant) size, we are interested in upper bounding the chromatic number in te作者: harbinger 時(shí)間: 2025-3-24 09:36
,Fast Parallel Algorithms for?Submodular ,-Superseparable Maximization, It has important applications in, e.g., machine learning and influence maximization. Though the theoretical problem admits polynomial-time approximation algorithms, solving it in practice often involves frequently querying submodular functions that are expensive to compute. This has motivated signi作者: 許可 時(shí)間: 2025-3-24 12:58 作者: FECT 時(shí)間: 2025-3-24 15:03
A. Czerny,F. Kraus,A. Schittenhelmase instances, and find that it performs far better than the average-case lower bound suggests. This indicates a shortcoming in the approach we use for our analysis, which is a rather common method in the analysis of local search heuristics.作者: Perigee 時(shí)間: 2025-3-24 19:31 作者: 戰(zhàn)役 時(shí)間: 2025-3-25 00:34 作者: intrigue 時(shí)間: 2025-3-25 03:40 作者: Evacuate 時(shí)間: 2025-3-25 08:55
,Probleme der adh?siven Perikarditis,-hard to obtain an approximation ratio better than 1.5. We show that if the input graph has a perfect matching, there is a polynomial time 1.625-approximation and if the graph is claw-free or if the maximum degree of the input graph is at most three (i.e., the graph is subcubic), there is a polynomial time 1.5-approximation algorithm for ..作者: agglomerate 時(shí)間: 2025-3-25 13:19
,Approximating Maximum Edge 2-Coloring by?Normalizing Graphs,-hard to obtain an approximation ratio better than 1.5. We show that if the input graph has a perfect matching, there is a polynomial time 1.625-approximation and if the graph is claw-free or if the maximum degree of the input graph is at most three (i.e., the graph is subcubic), there is a polynomial time 1.5-approximation algorithm for ..作者: 中和 時(shí)間: 2025-3-25 19:45
0302-9743 hanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems.978-3-031-49814-5978-3-031-49815-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 強(qiáng)制性 時(shí)間: 2025-3-25 22:51 作者: 用樹皮 時(shí)間: 2025-3-26 01:24
F. Kraus,Erich Meyer,L. Langsteinocessing volume. Our algorithm has a running time of ., where . is the difference between the last deadline and the earliest release time, and . is the running time of a maximum flow calculation in a network of . nodes.作者: 饒舌的人 時(shí)間: 2025-3-26 04:22
Calcium Metabolism and Kidney Disease,in general, make the problem NP-hard. We paint an almost complete picture of the evolving complexity landscape, drawing the line between easy and hard. One of our main algorithmic contributions relies on a deep structural result on the maximum imbalance of an optimal schedule, based on a subtle connection to Hilbert bases of a related convex cone.作者: 我說不重要 時(shí)間: 2025-3-26 08:42 作者: 厭倦嗎你 時(shí)間: 2025-3-26 15:10
,An Improved Deterministic Algorithm for?the?Online Min-Sum Set Cover Problem,previous constructive bound of . by Fotakis et al.?[ICALP ’20]. Furthermore, we show that our algorithm attains an asymptotically optimal competitive ratio of .(.) when compared to the best fixed permutation of elements.作者: TOXIN 時(shí)間: 2025-3-26 20:34
Greedy Minimum-Energy Scheduling,ocessing volume. Our algorithm has a running time of ., where . is the difference between the last deadline and the earliest release time, and . is the running time of a maximum flow calculation in a network of . nodes.作者: prosthesis 時(shí)間: 2025-3-26 23:33
Total Completion Time Scheduling Under Scenarios,in general, make the problem NP-hard. We paint an almost complete picture of the evolving complexity landscape, drawing the line between easy and hard. One of our main algorithmic contributions relies on a deep structural result on the maximum imbalance of an optimal schedule, based on a subtle connection to Hilbert bases of a related convex cone.作者: Fecal-Impaction 時(shí)間: 2025-3-27 01:08 作者: MAL 時(shí)間: 2025-3-27 06:50
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/160434.jpg作者: Goblet-Cells 時(shí)間: 2025-3-27 09:26 作者: Lament 時(shí)間: 2025-3-27 17:16 作者: 無脊椎 時(shí)間: 2025-3-27 18:44
,Probleme der adh?siven Perikarditis,rs. The problem maximum edge 2-coloring (.) is to find an edge 2-coloring in a graph . with the goal to . the number of colors. For a relevant graph class, . models anti-Ramsey numbers and it was considered in network applications. For the problem a 2-approximation algorithm is known, and if the inp作者: 割讓 時(shí)間: 2025-3-28 00:07
Das Amyloid und seine Entstehung,thm has to maintain the time-varying permutation of the list of . elements, and serve a sequence of requests .. Each . is a subset of elements of cardinality at most?.. For a requested set ., an online algorithm has to pay the cost equal to the position of the first element from . on its list. Then,作者: 同步左右 時(shí)間: 2025-3-28 06:06
F. Kraus,Erich Meyer,L. Langsteindividual release times, deadlines, and processing volumes must be scheduled across . parallel processors while minimizing the consumed energy. When idle, each processor can be turned off to save energy, while turning it on requires a fixed amount of energy. For the special case of a single processor作者: BLANK 時(shí)間: 2025-3-28 07:25 作者: paradigm 時(shí)間: 2025-3-28 12:12 作者: 一起 時(shí)間: 2025-3-28 18:32
Calcium Metabolism and Kidney Disease,duling problems. We study interesting generalizations of this classical problem involving scenarios. In our model, a scenario is defined as a subset of a predefined and fully specified set of jobs. The aim is to find an assignment of the whole set of jobs to identical parallel machines such that the作者: APNEA 時(shí)間: 2025-3-28 22:15
https://doi.org/10.1007/978-3-642-90683-1imum radius of any cluster is minimized. It is well-studied. But what if we add up the radii of the clusters instead of only considering the cluster with maximum radius? This natural variant is called the .-min-sum-radii problem. It has become the subject of more and more interest in recent years, i作者: CURB 時(shí)間: 2025-3-29 00:00
A. Czerny,Fr. Müller,A. Schittenhelmsome integers . and ., let . be the set of points in . with integral coordinates, and let . be a family of subsets of ., called objects. Both . and . are known in advance by the algorithm and by the adversary. Then, the adversary gives some objects one by one, and the algorithm has to maintain a val作者: BRAND 時(shí)間: 2025-3-29 03:29
https://doi.org/10.1007/978-3-642-90648-0r maximizing the total profit associated with the packed items. We present an approximation scheme under resource augmentation for the circle knapsack problem, i.e., a polynomial-time algorithm that, for any constant ., obtains a solution whose value is within a factor of . of the optimal value, usi作者: 鋪?zhàn)?nbsp; 時(shí)間: 2025-3-29 08:19 作者: 鈍劍 時(shí)間: 2025-3-29 12:06
Der arterielle Tiefdruck (Hypotonie),lgorithm must output a set of non-conflicting intervals. Traditionally in scheduling theory, it is assumed that intervals arrive in order of increasing start times. We drop that assumption and allow for intervals to arrive in any possible order. We call this variant . (AOIS). We assume that some onl作者: occult 時(shí)間: 2025-3-29 16:01 作者: subacute 時(shí)間: 2025-3-29 20:02
Der arterielle Tiefdruck (Hypotonie),imating the maximum-weight independent set in this graph class. For the extremal question, we consider the notion, that we call . .-. of a graph: Given a graph . that is assumed to contain an independent set of a certain (constant) size, we are interested in upper bounding the chromatic number in te作者: CLEFT 時(shí)間: 2025-3-30 03:46
A. Czerny,F. Kraus,A. Schittenhelm It has important applications in, e.g., machine learning and influence maximization. Though the theoretical problem admits polynomial-time approximation algorithms, solving it in practice often involves frequently querying submodular functions that are expensive to compute. This has motivated signi作者: 貧窮地活 時(shí)間: 2025-3-30 06:04
Approximation and Online Algorithms978-3-031-49815-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ungainly 時(shí)間: 2025-3-30 11:31 作者: BADGE 時(shí)間: 2025-3-30 14:25
978-3-031-49814-5The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: Prognosis 時(shí)間: 2025-3-30 20:26 作者: 追逐 時(shí)間: 2025-3-30 23:07
Das Amyloid und seine Entstehung,t-case approximation of . even when the predictions are arbitrarily wrong. In addition, we obtain improved approximations for three special cases: equal job sizes, infinitesimal job sizes, and binary machine speeds. We also complement our algorithmic results with lower bounds. Finally, we empiricall作者: 漂浮 時(shí)間: 2025-3-31 03:45
