標(biāo)題: Titlebook: Algorithms -- ESA 2010, Part II; 18th Annual European Mark Berg,Ulrich Meyer Conference proceedings 2010 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: Pierce 時(shí)間: 2025-3-21 18:19
書目名稱Algorithms -- ESA 2010, Part II影響因子(影響力)
書目名稱Algorithms -- ESA 2010, Part II影響因子(影響力)學(xué)科排名
書目名稱Algorithms -- ESA 2010, Part II網(wǎng)絡(luò)公開度
書目名稱Algorithms -- ESA 2010, Part II網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms -- ESA 2010, Part II被引頻次
書目名稱Algorithms -- ESA 2010, Part II被引頻次學(xué)科排名
書目名稱Algorithms -- ESA 2010, Part II年度引用
書目名稱Algorithms -- ESA 2010, Part II年度引用學(xué)科排名
書目名稱Algorithms -- ESA 2010, Part II讀者反饋
書目名稱Algorithms -- ESA 2010, Part II讀者反饋學(xué)科排名
作者: LIEN 時(shí)間: 2025-3-22 00:17 作者: 污穢 時(shí)間: 2025-3-22 02:21
Weitere Entwicklung der Massenbetontechnik,ribution of the individual input elements to the output size. To obtain nearly optimal algorithms for these problems, we introduce a parallel distribution sweeping technique inspired by its sequential counterpart.作者: conscience 時(shí)間: 2025-3-22 07:20 作者: Eviction 時(shí)間: 2025-3-22 09:37 作者: obsolete 時(shí)間: 2025-3-22 13:48 作者: 細(xì)胞學(xué) 時(shí)間: 2025-3-22 17:31
Top-, Ranked Document Search in General Text Databasesd in this paper. Our best approach is significantly faster than existing methods in RAM, and is even three times faster than a state-of-the-art inverted file implementation for English text when word queries are issued.作者: Nmda-Receptor 時(shí)間: 2025-3-22 23:31
https://doi.org/10.1007/978-3-7091-2358-4rst . truthful auctions which indeed provide essentially the best possible approximation guarantees achievable by any polynomial-time algorithm. This shows that deterministic truthful auctions have the same power as randomized ones if the bidders withdraw from unrealistic lies.作者: 悲痛 時(shí)間: 2025-3-23 02:05
https://doi.org/10.1007/978-3-658-30696-0 (some of which arise in kidney exchanges and online dating, and others arise in modeling online advertisements); we give LP-rounding based constant-factor approximation algorithms for these problems. Our main results are:作者: GUILT 時(shí)間: 2025-3-23 07:58
Combinatorial Auctions with Verification Are Tractablerst . truthful auctions which indeed provide essentially the best possible approximation guarantees achievable by any polynomial-time algorithm. This shows that deterministic truthful auctions have the same power as randomized ones if the bidders withdraw from unrealistic lies.作者: Cleave 時(shí)間: 2025-3-23 13:46 作者: 角斗士 時(shí)間: 2025-3-23 16:11
https://doi.org/10.1007/978-3-7091-4012-3n self-intersecting polygons with an unfolding in 4d. In contrast to this old result, our NP-hardness reductions are substantially simpler..As a positive result we show that the Fréchet distance between polygons with one hole can be computed in polynomial time.作者: 細(xì)頸瓶 時(shí)間: 2025-3-23 21:03
Der historische Roman und seine Formen,the running-time is .(.log.?+?(.?+?|.|).)..This is an extension of an algorithm by Erickson and Whittlesey [., 1038–1046 (2005)], which computes a shortest cut graph with a single given vertex. Moreover, our proof is simpler and also reveals that the algorithm actually computes a minimum-weight basis of some matroid.作者: 充氣女 時(shí)間: 2025-3-23 23:31 作者: 埋葬 時(shí)間: 2025-3-24 05:29 作者: farewell 時(shí)間: 2025-3-24 10:03 作者: 蛙鳴聲 時(shí)間: 2025-3-24 12:01
Shortest Cut Graph of a Surface with Prescribed Vertex Setthe running-time is .(.log.?+?(.?+?|.|).)..This is an extension of an algorithm by Erickson and Whittlesey [., 1038–1046 (2005)], which computes a shortest cut graph with a single given vertex. Moreover, our proof is simpler and also reveals that the algorithm actually computes a minimum-weight basis of some matroid.作者: 不舒服 時(shí)間: 2025-3-24 17:10
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Tieswhen preference lists of one side do not contain ties, and it cannot be approximated within . unless P=NP. However, even under this restriction, the best known approximation ratio is still 1.5. In this paper, we improve it to ..作者: 倫理學(xué) 時(shí)間: 2025-3-24 22:56
Pairing Heaps with Costless Meldre . is the size of the priority queue at the time the operation is performed. These bounds are the best known for any self-adjusting heap, and match the lower bound established by Fredman for a family of such priority queues. Moreover, our structure is even simpler than that in [1].作者: ingenue 時(shí)間: 2025-3-25 02:36 作者: 尖 時(shí)間: 2025-3-25 04:18
Algorithms -- ESA 2010, Part II978-3-642-15781-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Devastate 時(shí)間: 2025-3-25 10:51
0302-9743 Overview: up-to-date results.fast track conference proceedings.state-of-the-art report978-3-642-15780-6978-3-642-15781-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 法官 時(shí)間: 2025-3-25 14:40 作者: 做方舟 時(shí)間: 2025-3-25 18:58 作者: 徹底檢查 時(shí)間: 2025-3-25 21:36
Induced Matchings in Subcubic Planar GraphsWe present a linear-time algorithm that, given a planar graph with . edges and maximum degree 3, finds an induced matching of size at least ./9. This is best possible.作者: 遺傳學(xué) 時(shí)間: 2025-3-26 02:05
Shortest Paths in Planar Graphs with Real Lengths in ,(,log,,/loglog,) TimeGiven an .-vertex planar directed graph with real edge lengths and with no negative cycles, we show how to compute single-source shortest path distances in the graph in .(.log../loglog.) time with .(.) space. This improves on a recent .(.log..) time bound by Klein et al.作者: 雪白 時(shí)間: 2025-3-26 06:43 作者: colloquial 時(shí)間: 2025-3-26 10:47
https://doi.org/10.1007/978-3-658-36010-8ough an understanding of this quantity as is already known for nonatomic and unweighted congestion games, and take the form of universal (cost function-independent) worst-case examples. One noteworthy byproduct of our proofs is the fact that weighted congestion games are “tight”, which implies that 作者: rectocele 時(shí)間: 2025-3-26 15:32
https://doi.org/10.1007/978-3-662-26437-9 – a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute strong equilibria, which has polynomial running time for 作者: SEED 時(shí)間: 2025-3-26 17:44 作者: 歡樂中國 時(shí)間: 2025-3-26 22:51
,Erkl?rung der Geschwulstentwicklung,ers. The utility that buyer . derives from good . is ... Given an allocation . in which buyer . has utility . we suggest a quality measure that is based on taking an average of the ratios . with respect to any other allocation .. We motivate this quality measure, and show that market equilibrium is 作者: muster 時(shí)間: 2025-3-27 04:18 作者: overwrought 時(shí)間: 2025-3-27 06:48 作者: 出價(jià) 時(shí)間: 2025-3-27 12:37 作者: Outmoded 時(shí)間: 2025-3-27 15:25
Der historische Roman und seine Formen,t graph of?. with vertex set?.. (A cut graph is an embedded graph whose removal leaves a single topological disk.) If . has genus?. and complexity?., the running-time is .(.log.?+?(.?+?|.|).)..This is an extension of an algorithm by Erickson and Whittlesey [., 1038–1046 (2005)], which computes a sho作者: 感激小女 時(shí)間: 2025-3-27 19:21
https://doi.org/10.1007/978-3-476-03977-4um weight of a .-matching in the graph. Here a .-matching is a matching with at most . edges. In 2002, Hassin and Rubinstein [4] showed that every graph has a .-robust matching and it can be found by .-th power algorithm in polynomial time..In this paper, we show that it can be extended to the matro作者: comely 時(shí)間: 2025-3-27 22:19 作者: Feature 時(shí)間: 2025-3-28 03:08 作者: octogenarian 時(shí)間: 2025-3-28 07:32
https://doi.org/10.1007/978-3-476-04195-1p queries of the form “Is . in .?” can be answered with a small number of bitprobes. We obtain explicit schemes that come close to the information theoretic lower bound of Buhrman et al. [STOC 2000, SICOMP 2002] and improve the results of Radhakrishnan et al. [ESA 2001] when the size of sets and the作者: 議程 時(shí)間: 2025-3-28 13:20 作者: 打火石 時(shí)間: 2025-3-28 17:33
https://doi.org/10.1007/978-3-322-98650-4 same amortized bounds for other operations. More precisely, the new pairing heap requires: no cost per ., .(1) per . and ., . per ., and . per ., where . is the size of the priority queue at the time the operation is performed. These bounds are the best known for any self-adjusting heap, and match 作者: 駭人 時(shí)間: 2025-3-28 22:29 作者: AIL 時(shí)間: 2025-3-29 01:25 作者: 新奇 時(shí)間: 2025-3-29 03:48 作者: armistice 時(shí)間: 2025-3-29 11:06 作者: 平躺 時(shí)間: 2025-3-29 15:16
https://doi.org/10.1007/978-3-642-15781-3CSP; Matchings; algorithmic aspects; algorithms; calculus; data structures; databases; graph algorithms; par作者: dearth 時(shí)間: 2025-3-29 19:02 作者: 的染料 時(shí)間: 2025-3-29 22:24
https://doi.org/10.1007/978-3-658-36010-8roper . and a properly . can abundantly surpass the best expected technology advancements and the help coming from (sophisticated) operating systems or heuristics. As a result, data compression and indexing nowadays play a key role in the design of modern algorithms for applications that manage mass作者: 蔓藤圖飾 時(shí)間: 2025-3-29 23:52
https://doi.org/10.1007/978-3-662-26437-9-hard. In addition, we establish a variety of hardness results and lower bounds regarding the duration of unilateral and coalitional improvement dynamics. They continue to hold even for convergence to approximate equilibria.作者: 沒有希望 時(shí)間: 2025-3-30 07:45
,Erkl?rung der Geschwulstentwicklung,thm is optimal up to constants. Our algorithm uses a primal dual convex programming scheme. To the best of our knowledge this is the first time that such a scheme is used in the online framework..We also discuss an application of the framework in display advertising business in the last section.作者: perimenopause 時(shí)間: 2025-3-30 10:04
Der historische Roman und seine Formen,ances from .. to { .., ..., .. }, normalized by ., where the ordering of the points is that given by Prim’s minimum spanning tree algorithm. Feige also related this notion to the maximal Euclidean volume that a Lipschitz embedding of . into Euclidean space can achieve. Syntactically this definition 作者: 的’ 時(shí)間: 2025-3-30 16:04 作者: 滋養(yǎng) 時(shí)間: 2025-3-30 16:42
https://doi.org/10.1007/978-3-476-04195-1tight for adaptive schemes..We show that any non-adaptive three probe scheme for storing sets of size two from a universe of size . requires . bits of memory. This extends a result of Alon and Feige [SODA 2009] to small sets.作者: 神圣將軍 時(shí)間: 2025-3-30 22:26
Zur Theorie und Tradition der Gattung,ing optimal?.(.) bits additional space. For the case where queries can not probe?., we give a data structure of size?.(.· min {.,log.}) bits with?.(1) query time, assuming?.?≤?.. This leaves a gap to the lower bound of?Ω(.log.) bits for this version of the problem.作者: 猜忌 時(shí)間: 2025-3-31 04:43 作者: Cosmopolitan 時(shí)間: 2025-3-31 07:58
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games-hard. In addition, we establish a variety of hardness results and lower bounds regarding the duration of unilateral and coalitional improvement dynamics. They continue to hold even for convergence to approximate equilibria.作者: 詞匯 時(shí)間: 2025-3-31 10:27
How to Allocate Goods in an Online Market?thm is optimal up to constants. Our algorithm uses a primal dual convex programming scheme. To the best of our knowledge this is the first time that such a scheme is used in the online framework..We also discuss an application of the framework in display advertising business in the last section.作者: Criteria 時(shí)間: 2025-3-31 17:22 作者: Suppository 時(shí)間: 2025-3-31 19:45 作者: 動脈 時(shí)間: 2025-3-31 23:51
Data Structures for Storing Small Sets in the Bitprobe Modeltight for adaptive schemes..We show that any non-adaptive three probe scheme for storing sets of size two from a universe of size . requires . bits of memory. This extends a result of Alon and Feige [SODA 2009] to small sets.作者: impaction 時(shí)間: 2025-4-1 05:16 作者: Benzodiazepines 時(shí)間: 2025-4-1 06:39
Data Structures: Time, I/Os, Entropy, Joules!hers. To cope with these large datasets, software developers typically take advantage of faster and faster I/O-subsystems and multi-core processors, and/or they exploit the virtual memory to make the caching and delivering of data requested by their algorithms simple and effective whenever their wor作者: Affluence 時(shí)間: 2025-4-1 10:53 作者: 運(yùn)氣 時(shí)間: 2025-4-1 16:28 作者: 我不怕犧牲 時(shí)間: 2025-4-1 19:30 作者: Itinerant 時(shí)間: 2025-4-1 22:54
How to Allocate Goods in an Online Market?ers. The utility that buyer . derives from good . is ... Given an allocation . in which buyer . has utility . we suggest a quality measure that is based on taking an average of the ratios . with respect to any other allocation .. We motivate this quality measure, and show that market equilibrium is
