標(biāo)題: Titlebook: Algorithms and Data Structures; 11th International S Frank Dehne,Marina Gavrilova,Csaba D. Tóth Conference proceedings 2009 Springer-Verla [打印本頁(yè)] 作者: Halcyon 時(shí)間: 2025-3-21 18:43
書目名稱Algorithms and Data Structures影響因子(影響力)
書目名稱Algorithms and Data Structures影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度
書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Data Structures被引頻次
書目名稱Algorithms and Data Structures被引頻次學(xué)科排名
書目名稱Algorithms and Data Structures年度引用
書目名稱Algorithms and Data Structures年度引用學(xué)科排名
書目名稱Algorithms and Data Structures讀者反饋
書目名稱Algorithms and Data Structures讀者反饋學(xué)科排名
作者: ASSAY 時(shí)間: 2025-3-21 21:57 作者: comely 時(shí)間: 2025-3-22 01:59 作者: evaculate 時(shí)間: 2025-3-22 05:54 作者: 帳單 時(shí)間: 2025-3-22 11:14
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2,gated for long time since it is MAX SNP-hard and admits better approximations than the general problem. We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances 1 and 2, improving on the previously best known ratio of 1.279.作者: 障礙物 時(shí)間: 2025-3-22 14:52
Shortest Path Problems on a Polyhedral Surface,ll shortest path edge sequences and the diameter of a convex polyhedral surface. This speedup is achieved with kinetic Voronoi diagrams. We also use the star unfolding to compute a shortest path map and the Fréchet distance of a non-convex polyhedral surface.作者: 漸變 時(shí)間: 2025-3-22 20:42 作者: 鑲嵌細(xì)工 時(shí)間: 2025-3-23 00:32 作者: 慢慢沖刷 時(shí)間: 2025-3-23 03:08 作者: Leisureliness 時(shí)間: 2025-3-23 08:50 作者: 最高點(diǎn) 時(shí)間: 2025-3-23 09:42 作者: RALES 時(shí)間: 2025-3-23 16:39 作者: 歡樂(lè)中國(guó) 時(shí)間: 2025-3-23 20:09
Drawing Graphs with Right Angle Crossings,gs. We establish upper and lower bounds on these quantities by considering two classical graph drawing scenarios: The one where the algorithm can choose the combinatorial embedding of the input graph and the one where this embedding is fixed.作者: Asymptomatic 時(shí)間: 2025-3-23 22:12
Der Weg zum Neutrodyneempf?ngeres in the literature require a great deal of space overhead in the form of pointers. We present a dictionary data structure that makes use of both randomization and existing space-efficient data structures to yield very low space overhead while maintaining distribution sensitivity in the expected sense.作者: 入伍儀式 時(shí)間: 2025-3-24 05:02
Christoph Moss,Niklas Stog M.Sco the complexity in terms of the total length . of the input formula, resulting in an algorithm of running time .(2.)?=?.(1.0652.) for the . problem, improving the previous best upper bound .(2.)?=?.(1.0663.) for the problem.作者: 有特色 時(shí)間: 2025-3-24 08:23
https://doi.org/10.1007/978-3-658-22403-5odifications to treaps and amortized balanced binary search trees, and we show that in the comparison model, the bounds above are essentially the best possible. Finally, we conclude with a case study on the use of rank-sensitive priority queues for shortest path computation.作者: galley 時(shí)間: 2025-3-24 14:34
Conference proceedings 2009...The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 49 revised full papers presented in this volume were carefully reviewed and 作者: ATOPY 時(shí)間: 2025-3-24 14:55 作者: 華而不實(shí) 時(shí)間: 2025-3-24 19:12 作者: Hamper 時(shí)間: 2025-3-24 23:26
Rank-Sensitive Priority Queues,odifications to treaps and amortized balanced binary search trees, and we show that in the comparison model, the bounds above are essentially the best possible. Finally, we conclude with a case study on the use of rank-sensitive priority queues for shortest path computation.作者: obtuse 時(shí)間: 2025-3-25 05:47
Conference proceedings 2009selected from 126 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing..作者: 金桌活畫面 時(shí)間: 2025-3-25 07:57
0302-9743 iewed and selected from 126 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing..978-3-642-03366-7978-3-642-03367-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Incumbent 時(shí)間: 2025-3-25 14:23 作者: 不法行為 時(shí)間: 2025-3-25 17:03 作者: 寄生蟲 時(shí)間: 2025-3-25 22:21 作者: 谷物 時(shí)間: 2025-3-26 02:46
Minimal Locked Trees,trees. Next we present several new examples of locked trees with varying minimality results. Finally, we provide counterexamples to two conjectures of [12], [13] by showing the existence of two new types of locked tree: a locked orthogonal tree (all edges horizontal and vertical) and a locked equilateral tree (all edges unit length).作者: congenial 時(shí)間: 2025-3-26 04:17 作者: 易受刺激 時(shí)間: 2025-3-26 11:56 作者: acrimony 時(shí)間: 2025-3-26 13:34 作者: originality 時(shí)間: 2025-3-26 19:54 作者: 租約 時(shí)間: 2025-3-26 23:01
,Diagnostische Fallen (?pitfalls“),ults of network analysis, by making . part of the network. The feed-link has to be “reasonable”, hence we use the concept of dilation to determine the quality of a connection..We consider the following abstract problem: Given a simple polygon . with . vertices and a point . inside, determine a point作者: FACET 時(shí)間: 2025-3-27 04:27 作者: Vasoconstrictor 時(shí)間: 2025-3-27 05:59
https://doi.org/10.1007/978-3-476-03893-7tion algorithms for . and 2-approximation algorithms for . using appropriate primal-dual polytopes. We also show lower bounds on the integrality gap of the polytope to provide some intuition on the final limit of such approaches. Furthermore, we provide APX-hardness result for all those problems .5.作者: 不可救藥 時(shí)間: 2025-3-27 09:34 作者: 郊外 時(shí)間: 2025-3-27 14:13 作者: Offensive 時(shí)間: 2025-3-27 18:02
Der Weg zum Neutrodyneempf?nger often an overestimate of the actual time required. . data structures attempt to take advantage of underlying patterns in a sequence of operations in order to reduce time complexity, since access patterns are non-random in many applications. Unfortunately, many of the distribution-sensitive structur作者: 驕傲 時(shí)間: 2025-3-27 23:28
,?Einen Newsroom wird es niemals geben.“,ding on recent work by L?ffler and Snoeyink[21], we show how to leverage our knowledge of . for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, eg, overlapping disks of different sizes and fat regions.作者: Corral 時(shí)間: 2025-3-28 03:29 作者: concubine 時(shí)間: 2025-3-28 06:29
,?Einen Newsroom wird es niemals geben.“, Distances on the surface are measured by the length of a Euclidean shortest path. Our main result is a linear factor speedup for the computation of all shortest path edge sequences and the diameter of a convex polyhedral surface. This speedup is achieved with kinetic Voronoi diagrams. We also use t作者: constitute 時(shí)間: 2025-3-28 13:36
https://doi.org/10.1007/978-3-658-22403-5, where all points in a Euclidean space are candidates for network nodes. We present the first general approach for geometric versions of basic variants of the buy-at-bulk network design problem. It enables us to obtain quasi-polynomial-time approximation schemes for basic variants of the buy-at-bul作者: legitimate 時(shí)間: 2025-3-28 15:04 作者: Transfusion 時(shí)間: 2025-3-28 21:01
,Der Zweifachverst?rker mit Endverst?rkung,oss Canada. So began our journey into the interactions between algorithms and the arts. More and more, we find that our mathematical research and artistic projects converge, with the artistic side inspiring the mathematical side and vice versa. Mathematics itself is an art form, and through other me作者: 使人煩燥 時(shí)間: 2025-3-29 01:47 作者: 性冷淡 時(shí)間: 2025-3-29 05:47
https://doi.org/10.1007/978-3-642-03367-4algorithmics; algorithms; approximation; art gallery problem; combinatorial optimization; complexity; comp作者: laceration 時(shí)間: 2025-3-29 07:20 作者: PRO 時(shí)間: 2025-3-29 13:34
Approximating Transitive Reductions for Directed Networks,tion algorithms for . and 2-approximation algorithms for . using appropriate primal-dual polytopes. We also show lower bounds on the integrality gap of the polytope to provide some intuition on the final limit of such approaches. Furthermore, we provide APX-hardness result for all those problems .5.作者: Encapsulate 時(shí)間: 2025-3-29 15:53 作者: saphenous-vein 時(shí)間: 2025-3-29 20:55 作者: 要塞 時(shí)間: 2025-3-30 01:18 作者: Explosive 時(shí)間: 2025-3-30 07:34
,?Einen Newsroom wird es niemals geben.“,ding on recent work by L?ffler and Snoeyink[21], we show how to leverage our knowledge of . for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, eg, overlapping disks of different sizes and fat regions.作者: figment 時(shí)間: 2025-3-30 10:42
,Die L?sung des Besch?ftigungsproblems,We show that every .-planar clustered graph admits a straight-line .-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi [.].作者: 過(guò)于平凡 時(shí)間: 2025-3-30 12:33 作者: 錯(cuò)誤 時(shí)間: 2025-3-30 20:12
Straight-Line Rectangular Drawings of Clustered Graphs,We show that every .-planar clustered graph admits a straight-line .-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi [.].作者: 冷峻 時(shí)間: 2025-3-30 21:02
Skip-Splay: Toward Achieving the Unified Bound in the BST Model,We present skip-splay, the first binary search tree algorithm known to have a running time that nearly achieves the unified bound. Skip-splay trees require only .(. lg lg .?+?.(.)) time to execute a query sequence .?=?.. ... ... The skip-splay algorithm is simple and similar to the splay algorithm.作者: Oafishness 時(shí)間: 2025-3-31 03:06 作者: 纖細(xì) 時(shí)間: 2025-3-31 05:06
Plane Graphs with Parity Constraints,beled either even or odd. A graph . on . satisfies the parity constraint of a point .?∈?., if the parity of the degree of . in . matches its label. In this paper we study how well various classes of planar graphs can satisfy arbitrary parity constraints. Specifically, we show that we can always find作者: appall 時(shí)間: 2025-3-31 12:15
Online Priority Steiner Tree Problems,s users. For instance, in QoS multicasting, a source needs to efficiently transmit a message to a set of receivers, each requiring support at a different QoS level (e.g., bandwidth). This can be formulated as the . problem: Here, each link of the underlying network is associated with a priority valu作者: 嗎啡 時(shí)間: 2025-3-31 16:38 作者: 小鹿 時(shí)間: 2025-3-31 18:40 作者: 含糊其辭 時(shí)間: 2025-3-31 23:49 作者: 灰心喪氣 時(shí)間: 2025-4-1 03:10 作者: COUCH 時(shí)間: 2025-4-1 07:39 作者: 不規(guī)則的跳動(dòng) 時(shí)間: 2025-4-1 12:10 作者: 切割 時(shí)間: 2025-4-1 16:15
Delaunay Triangulation of Imprecise Points Simplified and Extended,ding on recent work by L?ffler and Snoeyink[21], we show how to leverage our knowledge of . for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, eg, overlapping disks of different sizes and fat regions.作者: 波動(dòng) 時(shí)間: 2025-4-1 19:44
An Improved SAT Algorithm in Terms of Formula Length,n weighted variable frequencies in the formula .. We then develop a branch-and-search algorithm for the . problem that tries to maximize the decreasing rates in terms of the .-value during the branch-and-search process. The complexity of the algorithm in terms of the .-value is finally converted int作者: Osmosis 時(shí)間: 2025-4-2 00:27
