標題: Titlebook: Algorithms – ESA 2005; 13th Annual European Gerth St?lting Brodal,Stefano Leonardi Conference proceedings 2005 Springer-Verlag Berlin Heide [打印本頁] 作者: 小巷 時間: 2025-3-21 18:20
書目名稱Algorithms – ESA 2005影響因子(影響力)
書目名稱Algorithms – ESA 2005影響因子(影響力)學(xué)科排名
書目名稱Algorithms – ESA 2005網(wǎng)絡(luò)公開度
書目名稱Algorithms – ESA 2005網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms – ESA 2005被引頻次
書目名稱Algorithms – ESA 2005被引頻次學(xué)科排名
書目名稱Algorithms – ESA 2005年度引用
書目名稱Algorithms – ESA 2005年度引用學(xué)科排名
書目名稱Algorithms – ESA 2005讀者反饋
書目名稱Algorithms – ESA 2005讀者反饋學(xué)科排名
作者: pantomime 時間: 2025-3-21 22:58 作者: 遺傳 時間: 2025-3-22 01:46 作者: cinder 時間: 2025-3-22 07:13 作者: 暖昧關(guān)系 時間: 2025-3-22 09:50 作者: 惰性女人 時間: 2025-3-22 14:22
Ein Gewebe aus Licht und Materie,of even very few memory faults may jeopardize the correctness of the computational results. An algorithm is resilient to memory faults if, despite the corruption of some memory values before or during its execution, it is nevertheless able to get a correct output at least on the set of uncorrupted v作者: GLADE 時間: 2025-3-22 19:12 作者: AXIOM 時間: 2025-3-22 21:30
https://doi.org/10.1007/978-3-642-91848-3t an adversary, physicists are brought up to believe in the benevolence of nature, and to believe that the answers to natural questions are often as simple—and as symmetric—as they possibly could be. Indeed, symmetry is intimately linked to every branch of physics, from classical conservation laws t作者: cortisol 時間: 2025-3-23 04:16
Wendung bei dorsoposteriorer Querlage,y node at least once. The goal is to minimize the number of edge traversals. It is known that the competitive ratio of online algorithms for this problem depends on the deficiency . of the graph, which is the minimum number of edges that must be added to make the graph Eulerian. We present the first作者: 音樂戲劇 時間: 2025-3-23 06:53
https://doi.org/10.1007/978-3-642-91848-3t a flooding strategy like expanding ring search can route a message in the minimum number of steps . while it causes a traffic (i.e. the total number of messages) of .. For optimizing traffic a single-path strategy is optimal producing traffic ., where . is the perimeter length of the barriers form作者: pellagra 時間: 2025-3-23 13:24 作者: 我說不重要 時間: 2025-3-23 17:07
https://doi.org/10.1007/978-3-642-91848-3m. The focus is on two types of valid inequalities, the cover inequalities and local cuts. We show how these inequalities can be considered in a Lagrangean relaxation without destroying the computationally simple structure of the subproblems. We present an extensive computational study on a large se作者: Cholecystokinin 時間: 2025-3-23 21:45 作者: 思想 時間: 2025-3-23 22:39
https://doi.org/10.1007/978-3-642-91848-3ria) in games with extremely succinct description that are defined on highly regular graphs such as the .-dimensional grid; we argue that such games are of interest in the modelling of large systems of interacting agents. We show that mixed Nash equilibria can be found in time exponential in the suc作者: 愛社交 時間: 2025-3-24 03:01
https://doi.org/10.1007/978-3-642-91848-3and, simple poly-time algorithms are available for various restricted – yet important – markets..In this paper, we experimentally explore the . between the general problem and the poly-time solvable special cases. More precisely, we analyze the performance of some simple algorithms, for inputs which作者: 彈藥 時間: 2025-3-24 08:59
https://doi.org/10.1007/978-3-642-91848-3. .) with .4, these results are the best yet, with running times of .(2.) for . = 5 and 作者: intricacy 時間: 2025-3-24 14:24
Wendung bei dorsoposteriorer Querlage, that this parameter . is an interesting measure which governs the complexity of finding cliques. In particular, if . is a constant, then we can enumerate all .-isolated maximal cliques in linear time, and if . = .(log .), then we can enumerate all .-isolated maximal cliques in polynomial time. Note作者: Infantry 時間: 2025-3-24 14:49
https://doi.org/10.1007/978-3-642-91848-3omplexity is .(. . . .log .?+?. . . .), where . is the number of vertices in the graph and . is the genus of the surface. If .?=?.(. .), this represents a considerable improvement over previous results by Thomassen, and Erickson and Har-Peled. We also give algorithms to find a shortest non-contracti作者: dagger 時間: 2025-3-24 23:02 作者: BIPED 時間: 2025-3-25 03:02
https://doi.org/10.1007/978-3-663-01365-5ncy, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such作者: inhumane 時間: 2025-3-25 06:31 作者: 代理人 時間: 2025-3-25 09:52 作者: 一加就噴出 時間: 2025-3-25 14:29
https://doi.org/10.1007/978-3-662-42571-8We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is .. The other is for undirected graphs and its approximation ratio is .. Both algorithms improve on the previous bests.作者: engender 時間: 2025-3-25 16:46 作者: 冥想后 時間: 2025-3-25 20:11
Algorithms – ESA 2005978-3-540-31951-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Dungeon 時間: 2025-3-26 00:56
0302-9743 Overview: 978-3-540-29118-3978-3-540-31951-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Pepsin 時間: 2025-3-26 06:46 作者: 招惹 時間: 2025-3-26 10:23
https://doi.org/10.1007/978-3-663-01365-5ncy, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.作者: 學(xué)術(shù)討論會 時間: 2025-3-26 15:40 作者: Maximize 時間: 2025-3-26 20:22 作者: 健忘癥 時間: 2025-3-26 23:14 作者: Throttle 時間: 2025-3-27 04:04
Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut, a graph. Through a series of improvements we are able to reduce the number of shortest path computations significantly. One key idea is to use the value of the best multicut encountered in the course of the algorithm. For almost all instances this multicut is significantly better than that computed by rounding the linear program.作者: 蛛絲 時間: 2025-3-27 07:57
,: Efficient and Exact Algorithms for Curves and Surfaces,ncy, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.作者: companion 時間: 2025-3-27 13:20
Designing Reliable Algorithms in Unreliable Memories,of even very few memory faults may jeopardize the correctness of the computational results. An algorithm is resilient to memory faults if, despite the corruption of some memory values before or during its execution, it is nevertheless able to get a correct output at least on the set of uncorrupted v作者: 歸功于 時間: 2025-3-27 15:31 作者: 轉(zhuǎn)換 時間: 2025-3-27 18:27
Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism,t an adversary, physicists are brought up to believe in the benevolence of nature, and to believe that the answers to natural questions are often as simple—and as symmetric—as they possibly could be. Indeed, symmetry is intimately linked to every branch of physics, from classical conservation laws t作者: 全等 時間: 2025-3-28 00:48 作者: 解開 時間: 2025-3-28 05:03
Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,t a flooding strategy like expanding ring search can route a message in the minimum number of steps . while it causes a traffic (i.e. the total number of messages) of .. For optimizing traffic a single-path strategy is optimal producing traffic ., where . is the perimeter length of the barriers form作者: STANT 時間: 2025-3-28 10:08 作者: exhilaration 時間: 2025-3-28 11:03
Relax-and-Cut for Capacitated Network Design,m. The focus is on two types of valid inequalities, the cover inequalities and local cuts. We show how these inequalities can be considered in a Lagrangean relaxation without destroying the computationally simple structure of the subproblems. We present an extensive computational study on a large se作者: 無孔 時間: 2025-3-28 16:29
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,,archy, the ratio of the cost of the best Nash or correlated equilibrium over the social optimum. We show that for the sum social cost, which corresponds to the average cost of the players, every linear congestion game has Nash and correlated price of stability at most 1.6. We also give an almost mat作者: 清唱劇 時間: 2025-3-28 21:07 作者: cyanosis 時間: 2025-3-29 01:19 作者: 他一致 時間: 2025-3-29 04:15
An Algorithm for the SAT Problem for Formulae of Linear Length,. .) with .4, these results are the best yet, with running times of .(2.) for . = 5 and 作者: critique 時間: 2025-3-29 10:05
Linear-Time Enumeration of Isolated Cliques, that this parameter . is an interesting measure which governs the complexity of finding cliques. In particular, if . is a constant, then we can enumerate all .-isolated maximal cliques in linear time, and if . = .(log .), then we can enumerate all .-isolated maximal cliques in polynomial time. Note作者: GROG 時間: 2025-3-29 14:24
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs,omplexity is .(. . . .log .?+?. . . .), where . is the number of vertices in the graph and . is the genus of the surface. If .?=?.(. .), this represents a considerable improvement over previous results by Thomassen, and Erickson and Har-Peled. We also give algorithms to find a shortest non-contracti作者: legislate 時間: 2025-3-29 18:36
Delineating Boundaries for Imprecise Regions,” We provide two classes of algorithms for the problem of computing reasonable boundaries of such regions, based on evidence of given data points that are deemed likely to lie either inside or outside the region. Our problem formulation leads to a number of problems related to red-blue point separat作者: 臭名昭著 時間: 2025-3-29 22:41 作者: Evacuate 時間: 2025-3-30 01:29
Min Sum Clustering with Penalties, a few distant objects, called ., may exert a disproportionately strong influence over the solution. In this work we investigate the . . clustering problem while addressing outliers in a meaningful way..Given a complete graph . = (.,.), a weight function . : . →. . on its edges, and . a penalty func作者: Pruritus 時間: 2025-3-30 06:25
Unbalanced Graph Cuts,ource side, subject to the constraint that its capacity not exceed a prescribed bound .. Besides being of interest in the study of graph cuts, this problem arises in many practical settings, such as in epidemiology, disaster control, military containment, as well as finding dense subgraphs and commu作者: Hamper 時間: 2025-3-30 11:18
Wendung bei dorsoposteriorer Querlage, that there is a graph which has a superlinear number of .-isolated cliques if . is not a constant, and there is a graph which has a superpolynomial number of .-isolated cliques if . = .(log .). In this sense our algorithm is optimal for the linear-time and polynomial-time enumeration of .-isolated cliques.作者: arbovirus 時間: 2025-3-30 14:55
Linear-Time Enumeration of Isolated Cliques, that there is a graph which has a superlinear number of .-isolated cliques if . is not a constant, and there is a graph which has a superpolynomial number of .-isolated cliques if . = .(log .). In this sense our algorithm is optimal for the linear-time and polynomial-time enumeration of .-isolated cliques.作者: 反叛者 時間: 2025-3-30 20:13 作者: 危機 時間: 2025-3-30 23:40
https://doi.org/10.1007/978-3-642-91848-3imple—and as symmetric—as they possibly could be. Indeed, symmetry is intimately linked to every branch of physics, from classical conservation laws to elementary particles to special and general relativity.作者: antiandrogen 時間: 2025-3-31 01:45 作者: intrude 時間: 2025-3-31 07:41
https://doi.org/10.1007/978-3-642-91848-3ngean relaxation without destroying the computationally simple structure of the subproblems. We present an extensive computational study on a large set of benchmark data. The results show that the presented algorithm outperforms many other exact and heuristical solvers in terms of running time and solution quality.作者: 表示問 時間: 2025-3-31 13:16
https://doi.org/10.1007/978-3-642-91848-3n the general problem and the poly-time solvable special cases. More precisely, we analyze the performance of some simple algorithms, for inputs which are relevant in practice, and where the theory does not provide poly-time guarantees.作者: Dappled 時間: 2025-3-31 13:23
Wendung bei dorsoposteriorer Querlage, are deemed likely to lie either inside or outside the region. Our problem formulation leads to a number of problems related to red-blue point separation and minimum-perimeter polygons, many of which we solve algorithmically. We give experimental results from our implementation and a comparison of the two approaches.作者: accrete 時間: 2025-3-31 18:34
Designing Reliable Algorithms in Unreliable Memories, corruption of some memory values before or during its execution, it is nevertheless able to get a correct output at least on the set of uncorrupted values. In this paper we will survey some recent work on reliable computation in the presence of memory faults.作者: 搜集 時間: 2025-3-31 22:48
Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism,imple—and as symmetric—as they possibly could be. Indeed, symmetry is intimately linked to every branch of physics, from classical conservation laws to elementary particles to special and general relativity.作者: 防水 時間: 2025-4-1 02:39
Exploring an Unknown Graph Efficiently,lem depends on the deficiency . of the graph, which is the minimum number of edges that must be added to make the graph Eulerian. We present the first deterministic online exploration algorithm whose competitive ratio is polynomial in . (it is .(. .)).作者: Demonstrate 時間: 2025-4-1 08:08 作者: 生存環(huán)境 時間: 2025-4-1 10:55
Computing Equilibrium Prices: Does Theory Meet Practice?,n the general problem and the poly-time solvable special cases. More precisely, we analyze the performance of some simple algorithms, for inputs which are relevant in practice, and where the theory does not provide poly-time guarantees.作者: 原諒 時間: 2025-4-1 15:44 作者: Highbrow 時間: 2025-4-1 22:07
https://doi.org/10.1007/978-3-642-91848-3. The same bound holds for symmetric games as well. We also extend the results about Nash equilibria to correlated equilibria for weighted congestion games and we show that when the social cost is the total latency, the price of anarchy is ..
