標(biāo)題: Titlebook: Approximation and Online Algorithms; 6th International Wo Evripidis Bampis,Martin Skutella Conference proceedings 2009 Springer-Verlag Berl [打印本頁] 作者: TRACT 時間: 2025-3-21 17:48
書目名稱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é)科排名
作者: JAUNT 時間: 2025-3-21 23:39 作者: inspiration 時間: 2025-3-22 02:06 作者: Ledger 時間: 2025-3-22 07:23 作者: 駭人 時間: 2025-3-22 12:41 作者: 交響樂 時間: 2025-3-22 13:57
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Treesof instances for which exact solutions can be found efficiently. When the tree is a . (i.e. if only one vertex has degree greater than 2) we give a polynomial-time algorithm to find an optimal solution, as well as a polyhedral description of the convex hull of all integral feasible solutions.作者: Nerve-Block 時間: 2025-3-22 18:01 作者: Pastry 時間: 2025-3-22 21:28
Stackelberg Strategies and Collusion in Network Games with Splittable Flow single atomic follower. Finally, we investigate SCALE for multiple coalitional followers, general networks, and affine linear latencies. We present the first known upper bound on the price of anarchy in this case. Our bound smoothly varies between 1.5 when .=?0 and full efficiency when .=?1.作者: 裝入膠囊 時間: 2025-3-23 04:08
Peak Shaving through Resource Bufferingty, with the goal of maximizing the amount by which the peak is reduced. We give efficient optimal algorithms for the offline problem, with and without a bounded battery. We also show how to find the optimal offline battery size, given the requirement that the final battery level equals the initial 作者: muster 時間: 2025-3-23 06:16
Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requfunctions in the same form as that of Sharma et al. Using ideas from Goemans and Berstimas [6], we give an (.log.)-approximation algorithm for the resulting problem, where . is the maximum connectivity requirement, and .=?2.54.作者: 議程 時間: 2025-3-23 10:14
Smoothing Imprecise 1.5D Terrainsn terrain analysis, in this paper we present two linear-time approximation algorithms, for minimizing the largest turning angle and for maximizing the smallest one. In addition, we also provide linear time exact algorithms for minimizing and maximizing the sum of the turning angles.作者: 輕信 時間: 2025-3-23 15:22
Dynamic Offline Conflict-Free Coloring for Unit Diskslored. This paper focuses on unit disks, i.e., disks with radius one. We give an algorithm that colors a sequence of . unit disks in the dynamic offline setting using .(log.) colors. The algorithm is asymptotically optimal because .(log.) colors is necessary to color some set of . unit disks for any value of . [9].作者: slipped-disk 時間: 2025-3-23 18:16
Conference proceedings 2009 competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.作者: Nostalgia 時間: 2025-3-23 23:18 作者: paragon 時間: 2025-3-24 04:55 作者: Overthrow 時間: 2025-3-24 09:06 作者: Esalate 時間: 2025-3-24 12:06
Chemische Bindung und Quantenmechanikconstraints. For example, we show that our scheme applies to the problems of minimizing the makespan or the weighted sum of completion times when the jobs have precedence constraints and/or release dates.作者: arbovirus 時間: 2025-3-24 16:23
https://doi.org/10.1007/BFb0109452near constraint. Using the technique we obtain approximation algorithms for natural variants of classic subset selection problems, including real-time scheduling, the . and maximum weight independent set.作者: predict 時間: 2025-3-24 21:42
Ergebnisse der Exakten Naturwissenschaftenunded by a polynomial in the number of vertices which are a constant number of hops away from it. We employ a new method for constructing the connected dominating set and we give the first analysis of trade-offs between approximation ratio and locality distance.作者: MAZE 時間: 2025-3-25 02:25
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constrainconstraints. For example, we show that our scheme applies to the problems of minimizing the makespan or the weighted sum of completion times when the jobs have precedence constraints and/or release dates.作者: Frequency 時間: 2025-3-25 06:10 作者: Glutinous 時間: 2025-3-25 11:06 作者: ornithology 時間: 2025-3-25 15:32 作者: 慢慢沖刷 時間: 2025-3-25 16:42
Springer Tracts in Modern Physics 22ted Clique, Minimum Weighted Dominating Set, Minimum Weighted Set Cover and Minimum Weighted Vertex Cover. The local modifications we consider are addition or removal of a constant number of edges to the graph, or elements to the covering sets in case of Set Cover problem. We present the following results: 作者: 清澈 時間: 2025-3-25 21:07 作者: SUGAR 時間: 2025-3-26 02:03
Dipolmoment und Molekularstruktur,3, we show that the problem remains NP-hard and not approximable within ., for some .>?1. By contrast, we give a polynomial-time algorithm for the case where the preference lists of one sex are of length at most 2.作者: 去才蔑視 時間: 2025-3-26 06:34 作者: 鑲嵌細(xì)工 時間: 2025-3-26 10:37 作者: Lumbar-Spine 時間: 2025-3-26 12:39
F. Hund,Ferdinand Trendelenburg is that of randomized algorithms against adaptive adversaries. For this case, we give a complete solution by proving that the optimal competitive ratio is 4/3. Additionally, we give a?lower bound of 1.2 for the 2-uniform case.作者: transdermal 時間: 2025-3-26 19:45 作者: characteristic 時間: 2025-3-26 22:15 作者: Allergic 時間: 2025-3-27 04:41
Cooperation in Multiorganization Matchingrganization can be penalized, we study the problem of maximizing the overall profit such that no organization gets less than it can obtain on its own. Complexity results, an approximation algorithm and a matching inapproximation bound are given.作者: 引起痛苦 時間: 2025-3-27 08:17
Randomized Algorithms for Buffer Management with 2-Bounded Delay is that of randomized algorithms against adaptive adversaries. For this case, we give a complete solution by proving that the optimal competitive ratio is 4/3. Additionally, we give a?lower bound of 1.2 for the 2-uniform case.作者: 細(xì)胞膜 時間: 2025-3-27 12:45 作者: 注意 時間: 2025-3-27 16:28
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Treesterminals, and the objective is to find a max-weight integral flow between terminal pairs subject to the capacities. This problem was shown to be .-hard by Garg, Vazirani and Yannakakis [Algorithmica, 1997], and a 4-approximation was given by Chekuri, Mydlarz and Shepherd [ACM Trans. Alg., 2007]. So作者: 背心 時間: 2025-3-27 19:24 作者: 背帶 時間: 2025-3-27 22:02 作者: 彈藥 時間: 2025-3-28 03:20
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machinesbefore their deadlines. We prove a new lower bound for online algorithms with immediate decision. This means that the jobs arrive over time and the algorithm has to decide the schedule of each job immediately upon its release. Our lower bound tends to ./(.???1)?≈?1.58 for many machines, matching the作者: manifestation 時間: 2025-3-28 09:15 作者: neolith 時間: 2025-3-28 10:38 作者: Prognosis 時間: 2025-3-28 17:13
Randomized Algorithms for Buffer Management with 2-Bounded Delaynd those packets on the outgoing link while maximizing the total weight of the packets that are sent before their deadlines expire. In the 2-bounded delay case, each packet has to be sent either in the step of its release or in the next step. In the deterministic case, the optimal competitive ratio 作者: 敘述 時間: 2025-3-28 19:04 作者: conscience 時間: 2025-3-28 23:43
Malicious Bayesian Congestion Gamesther the player is a rational player seeking to minimize her own delay, or – with a certain probability – the player is . in which case her only goal is to disturb the other players as much as possible..We show that such games do in general not possess a Bayesian Nash equilibrium in pure strategies 作者: Ganglion 時間: 2025-3-29 06:36 作者: 注意 時間: 2025-3-29 10:32
Peak Shaving through Resource Bufferingan energy demand through a combination of a new request, an unreliable amount of . energy (e.g. solar or wind power), and previously received energy. The added piece of infrastructure is the ., which can store surplus energy for future use. More generally, the demands could represent required amount作者: In-Situ 時間: 2025-3-29 11:47 作者: Conjuction 時間: 2025-3-29 16:43 作者: progestin 時間: 2025-3-29 23:20
Caching Content under Digital Rights Managementaching issues not previously studied. Technically, these problems include elements of ski rental algorithms as well as paging, and their generalizations, online “capital investment” and generalized caching (the Landlord algorithm). The introduction of DRM restrictions does not impact the competitive作者: STAT 時間: 2025-3-30 01:19 作者: 惰性女人 時間: 2025-3-30 04:52 作者: Macronutrients 時間: 2025-3-30 08:37 作者: 顯微鏡 時間: 2025-3-30 14:14 作者: MARS 時間: 2025-3-30 20:08 作者: CANT 時間: 2025-3-30 22:34 作者: 不透明 時間: 2025-3-31 03:45
Ergebnisse der Exakten Naturwissenschaftenubject to certain degree constraints on the vertices of the subgraph. This paper considers two natural . problems and studies their behavior in terms of approximation algorithms. These problems take as input an undirected graph .?=?(.,.), with |.|?=?. and |.|?=?.. Our results, together with the definition of the two problems, are listed below.作者: 燒瓶 時間: 2025-3-31 08:37 作者: Opponent 時間: 2025-3-31 12:56 作者: hauteur 時間: 2025-3-31 15:40
,Hochmolekulare Stoffe in L?sung,We give an .(.)-approximation for minimizing average flow time on unrelated machines, where . is the maximum number of different process times on a machine. Consequently, the ratio is .(log./log.) if all process times are a power of .. Here, . is the ratio of the maximum and minimum process time of a job.作者: 收藏品 時間: 2025-3-31 21:10
Minimizing Average Flow Time on Unrelated MachinesWe give an .(.)-approximation for minimizing average flow time on unrelated machines, where . is the maximum number of different process times on a machine. Consequently, the ratio is .(log./log.) if all process times are a power of .. Here, . is the ratio of the maximum and minimum process time of a job.作者: 發(fā)生 時間: 2025-3-31 22:15 作者: flimsy 時間: 2025-4-1 02:36
Dipolmoment und Molekularstruktur, stable matching. In many large-scale applications of ., we seek to match as many agents as possible. This motivates the problem of finding a maximum cardinality matching in . that admits the smallest number of blocking pairs (so is “as stable as possible”). We show that this problem is NP-hard and 作者: STELL 時間: 2025-4-1 09:26
Ergebnisse der Exakten Naturwissenschaftenubject to certain degree constraints on the vertices of the subgraph. This paper considers two natural . problems and studies their behavior in terms of approximation algorithms. These problems take as input an undirected graph .?=?(.,.), with |.|?=?. and |.|?=?.. Our results, together with the defi作者: confederacy 時間: 2025-4-1 11:03 作者: 小口啜飲 時間: 2025-4-1 18:09
