標題: Titlebook: Approximation and Online Algorithms; 16th International W Leah Epstein,Thomas Erlebach Conference proceedings 2018 Springer Nature Switzerl [打印本頁] 作者: 烈酒 時間: 2025-3-21 19:10
書目名稱Approximation and Online Algorithms影響因子(影響力)
書目名稱Approximation and Online Algorithms影響因子(影響力)學科排名
書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度
書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度學科排名
書目名稱Approximation and Online Algorithms被引頻次
書目名稱Approximation and Online Algorithms被引頻次學科排名
書目名稱Approximation and Online Algorithms年度引用
書目名稱Approximation and Online Algorithms年度引用學科排名
書目名稱Approximation and Online Algorithms讀者反饋
書目名稱Approximation and Online Algorithms讀者反饋學科排名
作者: SCORE 時間: 2025-3-21 20:50
978-3-030-04692-7Springer Nature Switzerland AG 2018作者: Conflict 時間: 2025-3-22 03:57
https://doi.org/10.1007/BFb0111113 is given, and requests are submitted in different times in this space by an adversary. The goal is to match requests, while minimizing the sum of distances between matched pairs in addition to the time intervals passed from the moment each request appeared until it is matched..In the online Minimum作者: Interferons 時間: 2025-3-22 05:43
,Halbleiter-Sperrschichtz?hler,n be probed which results in the knowledge of the distance between . and the target. The objective of the game is to minimize the number of steps needed to locate the target, wherever it is..We address the generalization of this game where . vertices can be probed at every step. Our game also genera作者: 使聲音降低 時間: 2025-3-22 09:18 作者: cochlea 時間: 2025-3-22 15:32 作者: 扔掉掐死你 時間: 2025-3-22 19:35 作者: cortisol 時間: 2025-3-23 01:13
Springer Tracts in Modern Physicsot of attention in the last decades and was analyzed in many different settings. The . is a theoretical and abstract model, where an algorithm has to decide how an agent, also called ., moves through a network with . vertices and . edges such that every point of interest is visited at least once. Fo作者: 社團 時間: 2025-3-23 04:01
Ergebnisse der Exakten Naturwissenschaftent two of the computers in a given network arranged as a two-dimensional grid structure want to communicate. The central authority can then, for every request, either grant it by establishing one of the possible connections in the grid, or reject the request. Thereby, the requests have to be answered作者: ostensible 時間: 2025-3-23 09:34 作者: 冷淡周邊 時間: 2025-3-23 12:26
Fortschritte der Theorie der Atomkerne,his problem, we are given a known set of workers, a distribution over job types, and non-negative utility weights for each pair of worker and job types. At each time step, a job is drawn i.i.d.?from the distribution over job types. Upon arrival, the job must be irrevocably assigned to a worker and c作者: 無法治愈 時間: 2025-3-23 17:29
https://doi.org/10.1007/978-3-642-94300-3ion packet that she wants to transmit using one of . multiple-access channels. To do that, a player chooses a slotted-time protocol that prescribes the probabilities with which at a given time-step she will attempt transmission at each channel. If more than one players try to transmit over the same 作者: SAGE 時間: 2025-3-23 18:22 作者: murmur 時間: 2025-3-23 22:59
Ergebnisse der Exakten Naturwissenschaftenbut also a positive weight. The cost of a bin is 1, and this cost is shared among the items being in the bin, proportionally to their weights. A packing is a Nash equilibrium (NE) if no item can decrease its cost by moving to another bin, and OPT means a packing where the items are packed optimally 作者: 晚間 時間: 2025-3-24 04:15
https://doi.org/10.1007/BFb0109279rest-neighbor searching, and spherical range searching in the corresponding metric space. However, its inherent complexity poses considerable computational challenges in practice. To address this problem we study distortion of the probabilistic embedding that results from projecting the curves to a 作者: GROVE 時間: 2025-3-24 08:20
Springer Tracts in Modern Physicsualization (NFV) networking paradigm, that is, deciding the placement of network functions while taking into consideration the dynamic nature of networks and workloads. We model the problem as a generalization of the classic Uncapacitated Facility Location (UFL) problem, where we consider both multi作者: 王得到 時間: 2025-3-24 12:06
Springer Tracts in Modern Physicssel, ., SODA, 2008) every comparison between two elements can return the wrong result with some fixed (small) probability ., and comparisons cannot be repeated. Computing the longest increasing subsequence exactly is impossible in this model, therefore, the objective is to identify a subsequence tha作者: Mendicant 時間: 2025-3-24 15:32
Anregungsstufen der leichten Atomkerne, total weight of the edges from . to . is at most . times the total weight of the edges from . to . for any .. Based on the combinatorial cut-sparsification framework by Fung et al.?(2011), we show that for any .-balanced weighted digraph . with . vertices and . edges there is a weighted subdigraph 作者: arterioles 時間: 2025-3-24 22:34
Approximation and Online Algorithms978-3-030-04693-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 車床 時間: 2025-3-25 00:10
Springer Tracts in Modern Physics 29We survey complexity and approximability results for certain families of geometric optimization problems. We explain a generic approximation approach for maximization problems that is built around norms with polyhedral unit balls, and we pose a multitude of open problems.作者: Pageant 時間: 2025-3-25 05:53 作者: 抗原 時間: 2025-3-25 10:50 作者: 細微的差異 時間: 2025-3-25 11:45 作者: Minuet 時間: 2025-3-25 18:54 作者: cavity 時間: 2025-3-25 21:48 作者: Assemble 時間: 2025-3-26 02:40
Springer Tracts in Modern Physicsthis result to develop the first virtualized services placement algorithm that accounts for dynamic changes. Our tri-criteria approximation algorithms provide constant approximation factors with respect to the overall performance and size constraints, and logarithmic approximation factors with respect to capacity constraints.作者: Breach 時間: 2025-3-26 04:52
Improved Approximation Algorithms for Minimum Power Covering Problemsieve ratio 73?/?60, and in addition give a simple efficient combinatorial algorithm with ratio 5?/?4. For all these NP-hard problems the previous best known ratio was 3?/?2. In the related . problem, . should contain a path from every . to some node in .. We obtain ratio 3?/?2 for this NP-hard problem, improving the trivial ratio of 2.作者: 擁護 時間: 2025-3-26 08:55
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.lable. The preferred worker is determined based on an optimal solution to a fractional transportation problem. If the preferred worker is not available, . randomly selects a worker from the available workers. We show that . maintains a uniform distribution over the workers even when the distribution over the job types is non-uniform.作者: MIRTH 時間: 2025-3-26 15:42 作者: 刺耳 時間: 2025-3-26 20:19 作者: hankering 時間: 2025-3-26 21:15 作者: 根除 時間: 2025-3-27 02:50
A Primal-Dual Online Deterministic Algorithm for Matching with Delaysegative and only requests with different polarities may be matched with each other. Unlike the existing randomized solutions, our approach does not depend on?the?size of the metric space and does not have to know it in advance.作者: 花費 時間: 2025-3-27 08:00 作者: resilience 時間: 2025-3-27 10:25
Conference proceedings 2018OA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018.. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 were: graph algorithms; inapproximability results; ne作者: Metamorphosis 時間: 2025-3-27 16:05
0302-9743 rithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018.. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 were: graph algorithms; inapproximability r作者: 高深莫測 時間: 2025-3-27 19:45 作者: AER 時間: 2025-3-28 01:07 作者: Modicum 時間: 2025-3-28 04:56 作者: 配置 時間: 2025-3-28 07:41 作者: 我不怕犧牲 時間: 2025-3-28 10:52 作者: Mystic 時間: 2025-3-28 16:44 作者: penance 時間: 2025-3-28 20:36
Strategic Contention Resolution in Multiple Channelstrategic contention resolution examine only the case of a single channel and show that the equilibrium protocols depend on the feedback that the communication system gives to the players. Here we present multi-channel equilibrium protocols in two main feedback classes, namely . and .. In particular,作者: 徹底檢查 時間: 2025-3-29 01:55 作者: frozen-shoulder 時間: 2025-3-29 03:28
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchyase of the game where the weight of any item is the same as its size, and any item has size at most one half. The previous bound was about 1.46457. Next we give another setting where the PoA is at most .. This value is better than any previous, that was got for such games.作者: 脫落 時間: 2025-3-29 10:24
Probabilistic Embeddings of the Fréchet Distanceinary experimental results stand in stark contrast with our lower bounds. They indicate that highly distorted projections happen very rarely in practice, and only for strongly conditioned input curves.作者: 巧思 時間: 2025-3-29 14:14
Longest Increasing Subsequence Under Persistent Comparison Errorsrints ., 2018) . elements in . time such that the maximum dislocation of an element is at most .. For the lower bounds, we prove that (i) there is a set of sequences, such that on a sequence picked randomly from this set every algorithm must return an .-approximation with high probability, and (ii) 作者: Mediocre 時間: 2025-3-29 19:32 作者: bifurcate 時間: 2025-3-29 22:09
https://doi.org/10.1007/BFb0111113m, . being the number of requests..We introduce .-competitive deterministic algorithms for both problems and for any fixed .. In particular, for a small enough . the competitive ratio becomes .. These are the first deterministic algorithms for the mentioned online matching problems, achieving a sub-作者: 刺耳的聲音 時間: 2025-3-30 00:51
,Halbleiter-Sperrschichtz?hler, a polynomial-time .-approximation algorithm in trees which gives a solution using at most one more step than the optimal one. It follows that the . Problem is polynomial-time solvable in trees if . is fixed.作者: 收集 時間: 2025-3-30 05:04
Ergebnisse der Exakten Naturwissenschaftenthis part is technically challenging since the reduction needs to define a valid priority function for Pair Matching while respecting the priority function for the other problem. Finally, we apply the template to obtain lower bounds for a number of standard discrete optimization problems.作者: 樹上結(jié)蜜糖 時間: 2025-3-30 08:22
Schriftleitung der ?Naturwissenschaften“rsion gives an .-approximation. We argue that this can be interpreted as a generalization of an analogous result by K?nemann et al. (Algorithmica?’11) for partial cover problems. Together with a lower bound construction by Mestre (STACS’08) for partial cover this implies that our bound is essentiall作者: innovation 時間: 2025-3-30 16:21 作者: 廢止 時間: 2025-3-30 17:22
Ergebnisse der Exakten Naturwissenschaftenm..Our results show that, without additional information, the central authority cannot perform satisfactorily well, and we establish a lower bound linear in |.| for the number of advice bits needed for near-optimal solutions, where |.| denotes the number of edges in the grid. Furthermore, concerning作者: antidote 時間: 2025-3-31 00:06 作者: 細胞學 時間: 2025-3-31 03:39 作者: Angiogenesis 時間: 2025-3-31 06:24
Ergebnisse der Exakten Naturwissenschaftenase of the game where the weight of any item is the same as its size, and any item has size at most one half. The previous bound was about 1.46457. Next we give another setting where the PoA is at most .. This value is better than any previous, that was got for such games.作者: 共同確定為確 時間: 2025-3-31 10:20 作者: 旋轉(zhuǎn)一周 時間: 2025-3-31 13:53 作者: labyrinth 時間: 2025-3-31 20:34 作者: debble 時間: 2025-4-1 00:24 作者: harangue 時間: 2025-4-1 03:24 作者: STERN 時間: 2025-4-1 08:19
Advice Complexity of Priority Algorithmsorithms to have access to advice, i.e., side information precomputed by an all-powerful oracle. Obtaining lower bounds in the priority model without advice can be challenging and may involve intricate adversary arguments. Since the priority model with advice is even more powerful, obtaining lower bo作者: 想象 時間: 2025-4-1 13:52
Approximating Node-Weighted ,-MST on Planar Graphsation algorithm for this problem. We achieve this by utilizing the recent Lagrangian-multiplier preserving (LMP) primal-dual 3-approximation for the node-weighted prize-collecting Steiner tree problem by Byrka et al. (SWAT’16) and adopting an approach by Chudak et al. (Math. Prog. ’04) regarding Lag作者: 殘廢的火焰 時間: 2025-4-1 15:17
Exploring Sparse Graphs with Advice (Extended Abstract)ot of attention in the last decades and was analyzed in many different settings. The . is a theoretical and abstract model, where an algorithm has to decide how an agent, also called ., moves through a network with . vertices and . edges such that every point of interest is visited at least once. Fo作者: SENT 時間: 2025-4-1 22:19
