標題: Titlebook: Algorithms and Complexity; 8th International Co Paul G. Spirakis,Maria Serna Conference proceedings 2013 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: 氣泡 時間: 2025-3-21 17:44
書目名稱Algorithms and Complexity影響因子(影響力)
書目名稱Algorithms and Complexity影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Complexity網(wǎng)絡(luò)公開度
書目名稱Algorithms and Complexity網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Complexity被引頻次
書目名稱Algorithms and Complexity被引頻次學(xué)科排名
書目名稱Algorithms and Complexity年度引用
書目名稱Algorithms and Complexity年度引用學(xué)科排名
書目名稱Algorithms and Complexity讀者反饋
書目名稱Algorithms and Complexity讀者反饋學(xué)科排名
作者: 織物 時間: 2025-3-21 23:17 作者: exceptional 時間: 2025-3-22 03:15 作者: 軌道 時間: 2025-3-22 08:22 作者: Jacket 時間: 2025-3-22 10:20 作者: Eviction 時間: 2025-3-22 14:55
Decentralized Throughput Scheduling,ria that are at most a factor (.?+?1) away from the global optimum, and this bound is tight. For identical machines, we improve this bound to ., which is shown to be tight, too. The latter result is obtained by considering subgame perfect equilibria of a corresponding sequential game. We also address some variations of the problem.作者: LITHE 時間: 2025-3-22 17:12
0302-9743 he 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and作者: MURAL 時間: 2025-3-22 22:11 作者: 被告 時間: 2025-3-23 04:34
Money-Based Coordination of Network Packets, by mutually trading their positions in router queues. We consider a corresponding Markov model of trade and show that there are Nash equilibria (NE) where queue positions and money are exchanged directly between the network packets. This simple approach, interestingly, delivers significant improvements for packets and routers.作者: BABY 時間: 2025-3-23 05:56
Michael Stahlmann,Walter Wendt-KleinbergDP). The algorithm achieves approximation ratio 1.5 for both directed and undirected graphs. We show that a .-approximation algorithm for MA2NDP with fixed activation values for . and . yields a .-approximation algorithm for the . (MA2EDP) problem. We also study the MA2NDP and MA2EDP problems for the special case |.|?=?2.作者: Ankylo- 時間: 2025-3-23 10:06
K?mpfe um die Autonomie der Medizinhat unless the Exponential Time Hypothesis (ETH) fails, this cannot be improved to 2. ·..; further, . does not have a polynomial kernel unless NP???coNP/poly. Finally, given a tree decomposition of width?., we show how to solve . in . time, improving a known algorithm for the parameter pathwidth.作者: 烤架 時間: 2025-3-23 14:07
,W?hlen im Schatten der Pandemie,ame. We also present a game with .?=?3 players in which such a restricted price of stability is 1.634. This shows that the analysis of Bilò and Bove (Journal of Interconnection Networks, Volume 12, 2011) is tight. In addition, we give an example for three players that improves the lower bound on the (unrestricted) price of stability to 1.571.作者: 怪物 時間: 2025-3-23 20:40 作者: 道學(xué)氣 時間: 2025-3-24 00:12
Approximation Algorithms for Disjoint ,-Paths with Minimum Activation Cost,DP). The algorithm achieves approximation ratio 1.5 for both directed and undirected graphs. We show that a .-approximation algorithm for MA2NDP with fixed activation values for . and . yields a .-approximation algorithm for the . (MA2EDP) problem. We also study the MA2NDP and MA2EDP problems for the special case |.|?=?2.作者: Basal-Ganglia 時間: 2025-3-24 05:36 作者: Aggrandize 時間: 2025-3-24 09:50 作者: Osmosis 時間: 2025-3-24 13:29 作者: 火車車輪 時間: 2025-3-24 18:43 作者: 從容 時間: 2025-3-24 22:22
Gottfried Schweiger,Michael Peitlere sense that for each pair of measures, ..,.., there exist functions ..,.. with ..(..)?>?..(..) but ..(..)?
作者: 龍蝦 時間: 2025-3-25 02:20
Christiane Lemke,Jakob Wiedekind the problem is NP-hard. Further, an adaptation of our polynomial-time algorithm solves an open problem posed by L?ffler and van Kreveld?[Algorithmica 56(2), 236–269 (2010)] about finding a maximum perimeter convex hull for a set of imprecise points modeled as line segments.作者: Counteract 時間: 2025-3-25 04:36
https://doi.org/10.1007/978-3-322-99757-9t the tasks they are able to perform. We study here the case where the weights are private data. We are interested in the best approximation ratios that can be achieved by a truthful mechanism. In particular, we investigate the problem under various assumptions on the way the agents can misreport the weights.作者: 入會 時間: 2025-3-25 11:15 作者: 品嘗你的人 時間: 2025-3-25 12:34
Four Measures of Nonlinearity,e sense that for each pair of measures, ..,.., there exist functions ..,.. with ..(..)?>?..(..) but ..(..)?
作者: PALL 時間: 2025-3-25 18:58
New Results on Stabbing Segments with a Polygon, the problem is NP-hard. Further, an adaptation of our polynomial-time algorithm solves an open problem posed by L?ffler and van Kreveld?[Algorithmica 56(2), 236–269 (2010)] about finding a maximum perimeter convex hull for a set of imprecise points modeled as line segments.作者: AVOID 時間: 2025-3-25 21:11 作者: Adulterate 時間: 2025-3-26 03:22
Algorithms and Complexity978-3-642-38233-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 物種起源 時間: 2025-3-26 04:28
https://doi.org/10.1007/978-3-322-98943-7s problem runs in time .(..) and requires .(..) memory. We present a simple greedy algorithm that approximates the optimum solution within a factor of 2 and show that our analysis is tight. Our algorithm runs in time .(.. log.) and needs only .(.) memory. In fact, the running time is .(...log.), where .. is the minimum number of gaps.作者: GRUEL 時間: 2025-3-26 08:51 作者: 江湖郎中 時間: 2025-3-26 12:49
978-3-642-38232-1Springer-Verlag Berlin Heidelberg 2013作者: Concomitant 時間: 2025-3-26 19:26 作者: Circumscribe 時間: 2025-3-26 21:24 作者: 共同給與 時間: 2025-3-27 04:19
Michael Stahlmann,Walter Wendt-Kleinbergd Resource Allocation Games are a generalization of congestion and bottleneck games where players have their strategies in multiple copies (colors). We focus on two main subclasses of these games depending on the player cost: in Colored Congestion Games the player cost is the sum of latencies of the作者: Expurgate 時間: 2025-3-27 05:23 作者: TAG 時間: 2025-3-27 10:17
K?mpfe um die Autonomie der Medizin.: given a directed acyclic graph, delete edges of minimum weight such that each resulting connected component of the underlying undirected graph contains only one sink. Motivated by NP-hardness and hardness of approximation results, we consider the parameterized complexity of this problem. We show 作者: 連接 時間: 2025-3-27 16:49
Gottfried Schweiger,Michael Peitlert implementations), yet hard to invert almost everywhere. A necessary condition for the latter property is to be “sufficiently distant” from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that four common measures, ., and ., are incomparable in th作者: 谷物 時間: 2025-3-27 18:20 作者: 持久 時間: 2025-3-27 23:30
https://doi.org/10.1007/978-3-658-26578-6n, Garey, and Johnson motivated by the dynamic storage problem. Bar-Noy et al. have studied packing of unit fraction items (i.e., items with length 1/. for some integer .?≥?1), motivated by the window scheduling problem. In this paper, we extend the study of 2-D and 3-D dynamic bin packing problem t作者: ALIAS 時間: 2025-3-28 02:47
https://doi.org/10.1007/978-3-322-98943-7s problem runs in time .(..) and requires .(..) memory. We present a simple greedy algorithm that approximates the optimum solution within a factor of 2 and show that our analysis is tight. Our algorithm runs in time .(.. log.) and needs only .(.) memory. In fact, the running time is .(...log.), whe作者: 流利圓滑 時間: 2025-3-28 10:17 作者: Conflagration 時間: 2025-3-28 12:31 作者: amnesia 時間: 2025-3-28 15:03
Christiane Lemke,Jakob Wiedekindwo endpoints is contained in .. A segment set . is stabbed by . if every segment of . is stabbed by .. We show that if . is a set of pairwise disjoint segments, the problem of computing the minimum perimeter polygon stabbing . can be solved in polynomial time. We also prove that for general segments作者: STING 時間: 2025-3-28 20:04 作者: 加劇 時間: 2025-3-29 00:20
Manfred Gailus,Heinrich Volkmannssing any of the barriers. Sensors are initially located in the plane and they can . to the barriers. We assume that each sensor can detect any intruder in a circular area centered at the sensor. Given a set of barriers and a set of sensors located in the plane, we study three problems: the feasibil作者: 大笑 時間: 2025-3-29 07:05
https://doi.org/10.1007/978-3-322-99757-9 interested in provable hard problems which have a big set of hard instances. Moreover, we consider efficient generators of these hard instances of the problems. Our investigation has possible applications in cryptography. As a first step, we consider computational problems from the . class..We exte作者: hemophilia 時間: 2025-3-29 09:30 作者: ARCHE 時間: 2025-3-29 12:48
https://doi.org/10.1007/978-3-322-99757-9nism is truthful if no agent has an incentive to misreport her values on the tasks (agent .. reports a score .. for each task ..). The one-to-one version of this problem has already been studied by Dughmi and Ghosh [4] in a setting where the weights .. are public knowledge, and the agents only repor作者: 神秘 時間: 2025-3-29 18:14
Manfred Gailus,Heinrich Volkmannaph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be separated. The objective here is to maintain a clustering the never deviates too far in the objective function compared to the optimal solution. We give a constant competitive upper作者: 袋鼠 時間: 2025-3-29 23:29
Paul G. Spirakis,Maria SernaFast track conference proceedings.State-of-the-art research.Up to date results作者: effrontery 時間: 2025-3-30 00:58 作者: 修正案 時間: 2025-3-30 06:23 作者: scotoma 時間: 2025-3-30 11:46
Conference proceedings 2013na, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.作者: lymphoma 時間: 2025-3-30 12:32
Approximation Algorithms for Disjoint ,-Paths with Minimum Activation Cost,activation functions from .. to {0,1}, where . is a constant-size domain. The goal is to find activation values .. for all .?∈?. of minimum total cost ∑?... such that the activated set of edges satisfies some connectivity requirements. Network activation problems generalize several problems studied 作者: 無法破譯 時間: 2025-3-30 20:00 作者: VOC 時間: 2025-3-30 23:48 作者: SOBER 時間: 2025-3-31 03:14
Average Optimal String Matching in Packed Strings, able to efficiently search for all occurrences of the string(s) in a given text . of length .. In our model, we assume that text and patterns are tightly packed so that any single character occupies log. bits and thus any sequence of . consecutive characters in the text or the pattern occupies exac作者: 蔑視 時間: 2025-3-31 05:34
Parameterized Complexity of DAG Partitioning,.: given a directed acyclic graph, delete edges of minimum weight such that each resulting connected component of the underlying undirected graph contains only one sink. Motivated by NP-hardness and hardness of approximation results, we consider the parameterized complexity of this problem. We show 作者: 緩和 時間: 2025-3-31 11:34
Four Measures of Nonlinearity,t implementations), yet hard to invert almost everywhere. A necessary condition for the latter property is to be “sufficiently distant” from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that four common measures, ., and ., are incomparable in th作者: 雄偉 時間: 2025-3-31 16:24
On the Characterization of Plane Bus Graphs,,.) of bus vertices . realized by single horizontal and vertical segments, and point vertices . that are connected orthogonally to the bus segments without any bend. The decision whether a bipartite graph admits a bus realization is NP-complete. In this paper we show that in contrast the question wh作者: 褻瀆 時間: 2025-3-31 17:52
