標(biāo)題: Titlebook: Algorithms -- ESA 2011; 19th Annual European Camil Demetrescu,Magnús M. Halldórsson Conference proceedings 2011 Springer-Verlag GmbH Berlin [打印本頁] 作者: 吞食 時間: 2025-3-21 19:01
書目名稱Algorithms -- ESA 2011影響因子(影響力)
書目名稱Algorithms -- ESA 2011影響因子(影響力)學(xué)科排名
書目名稱Algorithms -- ESA 2011網(wǎng)絡(luò)公開度
書目名稱Algorithms -- ESA 2011網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms -- ESA 2011被引頻次
書目名稱Algorithms -- ESA 2011被引頻次學(xué)科排名
書目名稱Algorithms -- ESA 2011年度引用
書目名稱Algorithms -- ESA 2011年度引用學(xué)科排名
書目名稱Algorithms -- ESA 2011讀者反饋
書目名稱Algorithms -- ESA 2011讀者反饋學(xué)科排名
作者: APEX 時間: 2025-3-21 23:34
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graphe the efficiency of fast heuristics. First, we present a linear-time heuristic that gives a 3-approximation of the smallest 2-VCSS. Then we show that this heuristic can be combined with an algorithm of Cheriyan and Thurimella that achieves a (1?+?1/.)-approximation of the smallest .-VCSS. The combin作者: intricacy 時間: 2025-3-22 03:13
Improved Approximation Algorithms for Bipartite Correlation Clusteringg (CC) problem. Given a bipartite graph, the objective of BCC is to generate a set of vertex-disjoint bi-cliques (clusters) which minimizes the symmetric difference to it. The best known approximation algorithm for BCC due to Amit (2004) guarantees an 11-approximation ratio..In this paper we present作者: 擴(kuò)張 時間: 2025-3-22 07:44 作者: 纖細(xì) 時間: 2025-3-22 10:00 作者: SNEER 時間: 2025-3-22 13:25 作者: Pudendal-Nerve 時間: 2025-3-22 20:15 作者: 停止償付 時間: 2025-3-22 23:15 作者: NEG 時間: 2025-3-23 04:56
On the Approximation Performance of Fictitious Play in Finite Gameslass of two-player games having payoffs in the range [0,1] that show that Fictitious Play fails to find a solution having an additive approximation guarantee significantly better than 1/2. Our construction shows that for .×. games, in the worst case both players may perpetually have mixed strategies作者: goodwill 時間: 2025-3-23 09:07
How Profitable Are Strategic Behaviors in a Market?egic behaviors of individual buyers in market equilibria. While simple examples illustrate that buyers do get larger utilities when behaving strategically, we show that the benefits can be quite limited: We introduce the concept of . to capture the extent to which utility can be increased by strateg作者: 嬰兒 時間: 2025-3-23 10:38
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms3; this maximum is attained already for a simple network of two parallel links, known as Pigou’s network. We improve upon the value 4/3 by means of Coordination Mechanisms..We increase the latency functions of the edges in the network, i.e., if ?.(.) is the latency function of an edge ., we replace 作者: Magnitude 時間: 2025-3-23 13:58 作者: 比喻好 時間: 2025-3-23 21:51
An , Time Algorithm to Compute the Bisection Width of Solid Grid Graphsnimised. A . is a finite connected subgraph of the infinite two-dimensional grid. It is called . if it has no holes. Papadimitriou and Sideri?[8] gave an . time algorithm to solve the bisection problem on solid grid graphs. We propose a novel approach that exploits structural properties of optimal c作者: commute 時間: 2025-3-23 22:55 作者: Magisterial 時間: 2025-3-24 05:35 作者: botany 時間: 2025-3-24 09:24 作者: BRAWL 時間: 2025-3-24 12:10 作者: 寬宏大量 時間: 2025-3-24 14:52
Quantified Linear Programs: A Computational Studys PSPACE-complete, and the problem is similar to games like chess, where an existential and a universal player have to play a two-person-zero-sum game. At the same time, a QLP with . variables is a variant of a linear program living in ., and it has strong similarities with multi-stage stochastic li作者: 胎兒 時間: 2025-3-24 21:05
Recoverable Robustness by Column Generation some recovery action must be taken to cope with the disturbance. In such a situation it is worthwhile to arm yourself against common disturbances. Well-known approaches to create plans that take possible, common disturbances into account are robust optimization and stochastic programming. Recently,作者: botany 時間: 2025-3-25 00:09
https://doi.org/10.1007/978-3-642-23719-5combinatorial optimization; linear programming; online algorithms; parameterized algorithms; worst case 作者: 尖叫 時間: 2025-3-25 04:35 作者: Comedienne 時間: 2025-3-25 09:36
Bounds on Greedy Algorithms for MAX?SATte model of data items. As a consequence we obtain that the Slack–Algorithm of?[13] cannot be derandomized. Moreover, we present a significantly simpler version of the Slack–Algorithm and also simplify its analysis. Additionally, we show that the algorithm achieves a ratio of?. even if we compare its score with the optimal . score.作者: 嫌惡 時間: 2025-3-25 13:50
Min-Cuts and Shortest Cycles in Planar Graphs in ,(, loglog,) Timeously known fastest algorithm by Italiano . in STOC’11 by a factor of log.. This speedup is obtained through the use of dense distance graphs combined with a divide-and-conquer approach. Extending this approach we are able to show an .(.. log..) time dynamic algorithm al well.作者: 察覺 時間: 2025-3-25 19:04 作者: Malleable 時間: 2025-3-25 21:22 作者: 獎牌 時間: 2025-3-26 02:17
https://doi.org/10.1007/978-3-531-90938-7ously known fastest algorithm by Italiano . in STOC’11 by a factor of log.. This speedup is obtained through the use of dense distance graphs combined with a divide-and-conquer approach. Extending this approach we are able to show an .(.. log..) time dynamic algorithm al well.作者: 原諒 時間: 2025-3-26 04:52 作者: 顯而易見 時間: 2025-3-26 10:57
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153294.jpg作者: 濕潤 時間: 2025-3-26 14:35 作者: mitral-valve 時間: 2025-3-26 19:00
Grundlagen der empirischen Untersuchung,e the efficiency of fast heuristics. First, we present a linear-time heuristic that gives a 3-approximation of the smallest 2-VCSS. Then we show that this heuristic can be combined with an algorithm of Cheriyan and Thurimella that achieves a (1?+?1/.)-approximation of the smallest .-VCSS. The combin作者: TOM 時間: 2025-3-27 00:57 作者: 鄙視 時間: 2025-3-27 02:36 作者: Instantaneous 時間: 2025-3-27 07:49
Der Lebensmittelsektor als Fallbeispiel,ch that each pair of terminals is connected by a set of axis-parallel line segments whose total length is equal to the pair’s Manhattan (that is, ..-) distance. The problem is NP-hard in 2D and there is no PTAS for 3D (unless .). Approximation algorithms are known for 2D, but not for 3D..We present,作者: 谷物 時間: 2025-3-27 12:42
https://doi.org/10.1007/978-3-658-00885-7ts in the plane, there exists no path between any pair of these points that is not intercepted by some disk. We try to achieve this separation using a minimum number of a given set of unit disks. We show that a constant factor approximation to this problem can be found in polynomial time using a gre作者: BLOT 時間: 2025-3-27 17:00
https://doi.org/10.1007/978-3-658-00885-7 the .-NN Delaunay graph, which corresponds to the graph theoretic dual of the .-NN Voronoi diagram, and uses it as a base to directly compute the .-NN Voronoi diagram in ... In the .., .. metrics this results in .((.?+?.)log.) time algorithm, using segment-dragging queries, where . is the structura作者: Genome 時間: 2025-3-27 17:51
https://doi.org/10.1007/978-3-322-82803-3m in computational geometry. Fast theoretical solutions are known, e.g. point location in the Voronoi Diagram of ., or specialized structures such as so-called Delaunay hierarchies. However, practitioners tend to deem these solutions as too complicated or computationally too costly to be actually us作者: conference 時間: 2025-3-27 22:53
https://doi.org/10.1007/978-3-322-82803-3lass of two-player games having payoffs in the range [0,1] that show that Fictitious Play fails to find a solution having an additive approximation guarantee significantly better than 1/2. Our construction shows that for .×. games, in the worst case both players may perpetually have mixed strategies作者: 動作謎 時間: 2025-3-28 05:14
Der internationale Fernsehformathandelegic behaviors of individual buyers in market equilibria. While simple examples illustrate that buyers do get larger utilities when behaving strategically, we show that the benefits can be quite limited: We introduce the concept of . to capture the extent to which utility can be increased by strateg作者: Gorilla 時間: 2025-3-28 07:23
Zum Gegenstand: Fernsehen und Unterhaltung,3; this maximum is attained already for a simple network of two parallel links, known as Pigou’s network. We improve upon the value 4/3 by means of Coordination Mechanisms..We increase the latency functions of the edges in the network, i.e., if ?.(.) is the latency function of an edge ., we replace 作者: 痛苦一下 時間: 2025-3-28 13:01
Schlussfolgerungen und Implikationen,pairwise vertex-disjoint paths .., …, .. such that .. connects .. and .. for .?=?1, …, .. For a given graph ., we consider the problem of finding a maximum induced subgraph of . that is not .-linked. This problem is a common generalization of computing the vertex-connectivity and testing the .-linke作者: forestry 時間: 2025-3-28 16:16 作者: 為寵愛 時間: 2025-3-28 19:52 作者: Increment 時間: 2025-3-28 23:53
Schlussfolgerungen und Implikationen,captures the preferences of the vertices in a . way. Matching . is more popular than matching .′ if the number of vertices that prefer . to .′ is more than those that prefer .′ to .. The . of . measures by what factor any matching can be more popular than .. We show that . always admits a matching w作者: opprobrious 時間: 2025-3-29 06:15
Der internationale Fernsehformathandelupper bound on the number of positions it provides. It is well-known that in any instance, there exists at least one stable matching, and finding one can be done in polynomial time. In this paper, we consider an extension in which each hospital specifies not only an upper bound but also a . bound on作者: 遣返回國 時間: 2025-3-29 10:40 作者: Customary 時間: 2025-3-29 15:01
Zum Gegenstand: Fernsehen und Unterhaltung,s PSPACE-complete, and the problem is similar to games like chess, where an existential and a universal player have to play a two-person-zero-sum game. At the same time, a QLP with . variables is a variant of a linear program living in ., and it has strong similarities with multi-stage stochastic li作者: 古文字學(xué) 時間: 2025-3-29 18:11
Ergebnisse der empirischen Untersuchung, some recovery action must be taken to cope with the disturbance. In such a situation it is worthwhile to arm yourself against common disturbances. Well-known approaches to create plans that take possible, common disturbances into account are robust optimization and stochastic programming. Recently,作者: 弄污 時間: 2025-3-29 21:39 作者: 嬉耍 時間: 2025-3-30 01:33 作者: PANIC 時間: 2025-3-30 04:45
Schlussfolgerungen und Implikationen,hose unpopularity factor is .(log|.|) and such a matching can be computed in linear time. In our problem the optimal matching would be a . unpopularity factor matching - we show that computing such a matching is NP-hard. In fact, for any .?>?0, it is NP-hard to compute a matching whose unpopularity factor is at most 4/3???. of the optimal.作者: entreat 時間: 2025-3-30 10:30
Organisationstheoretische Grundlagen, tackling the problem, while also combining and extending recently introduced tools..In particular we give the first approximation algorithms for Bayesian auctions with multiple heterogeneous items when bidders have additive valuations, budget constraints and general matroid feasibility constraints.作者: freight 時間: 2025-3-30 12:36
An Output-Sensitive Approach for the ,,/,,,-Nearest-Neighbor Voronoi Diagraml complexity (size) of the .-NN Voronoi diagram of . point sites in the plane. The paper also gives a tighter bound on the structural complexity of the .-NN Voronoi diagram in the .. (equiv. ..) metric, which is shown to be .(min{.(.???.), (.???.).}).作者: Itinerant 時間: 2025-3-30 17:57 作者: PATRI 時間: 2025-3-30 21:37 作者: 飛行員 時間: 2025-3-31 03:17
Multi-parameter Mechanism Design under Budget and Matroid Constraints tackling the problem, while also combining and extending recently introduced tools..In particular we give the first approximation algorithms for Bayesian auctions with multiple heterogeneous items when bidders have additive valuations, budget constraints and general matroid feasibility constraints.作者: 暫停,間歇 時間: 2025-3-31 08:12 作者: 鎮(zhèn)痛劑 時間: 2025-3-31 10:58
0302-9743 ual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011.The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 1作者: kidney 時間: 2025-3-31 14:23
Der Lebensmittelsektor als Fallbeispiel, distance. The problem is NP-hard in 2D and there is no PTAS for 3D (unless .). Approximation algorithms are known for 2D, but not for 3D..We present, for any fixed dimension?. and any ., an .-approximation. For 3D, we also give a 4(.???1)-approximation for the case that the terminals are contained in the union of .?≥?2 parallel planes.作者: Synthesize 時間: 2025-3-31 21:15 作者: ventilate 時間: 2025-4-1 01:25
