標(biāo)題: Titlebook: Algorithms and Data Structures; 9th International Wo Frank Dehne,Alejandro López-Ortiz,J?rg-Rüdiger Sac Conference proceedings 2005 Springe [打印本頁] 作者: abandon 時間: 2025-3-21 18:58
書目名稱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é)科排名
作者: 河流 時間: 2025-3-21 23:58
Balanced Aspect Ratio Trees Revisitedund, and the resulting algorithm, are much simpler than what is known for general BAR trees. We call the resulting BAR trees Parameterized BAR trees and empirically evaluate them for different partitioning planes. Our experiments show that our theoretical bound converges to the empirically obtained 作者: Adrenaline 時間: 2025-3-22 01:09
Max-stretch Reduction for Tree Spanners-stretch to . – 1. (iv) Finally, we show that the max-stretch of an arbitrary graph on . vertices can be reduced to .′≥ 2 by inserting .(./.′) edges, which can be determined in linear time, and observe that this number of edges is optimal up to a constant.作者: 鳥籠 時間: 2025-3-22 07:58 作者: 頌揚本人 時間: 2025-3-22 10:07
Der Magnet: Du oder dein Unternehmen?,c models (e.g. for a greedy optimization algorithm) that are as widely accepted as the Church-Turing definition for “computable function”. While this goal is probably much too ambitious, we would at least like to have models that capture most of the algorithms that fit within these common paradigms.作者: Infect 時間: 2025-3-22 16:52
https://doi.org/10.1007/978-3-642-91917-6und, and the resulting algorithm, are much simpler than what is known for general BAR trees. We call the resulting BAR trees Parameterized BAR trees and empirically evaluate them for different partitioning planes. Our experiments show that our theoretical bound converges to the empirically obtained 作者: Assault 時間: 2025-3-22 18:03
https://doi.org/10.1007/978-3-642-94238-9-stretch to . – 1. (iv) Finally, we show that the max-stretch of an arbitrary graph on . vertices can be reduced to .′≥ 2 by inserting .(./.′) edges, which can be determined in linear time, and observe that this number of edges is optimal up to a constant.作者: 情愛 時間: 2025-3-23 01:05
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153144.jpg作者: Ligament 時間: 2025-3-23 05:17
Der Magnet: Du oder dein Unternehmen?,backtracking, dynamic programming, divide and conquer, local search, primal-dual, etc. (but not etc. etc.). We seem to be able to intuitively describe what we have in mind when we discuss these classes of algorithms but rarely (if ever) do we attempt to define precisely what we mean by such terms as作者: Valves 時間: 2025-3-23 06:06
,Die Ideen über das Metaphysische, only take place at the root of the tree, or at the right child of the root. A sharp upper bound ..(., .) ≤ 4n – 8 is known, based on the word metric of Thompson’s group. We refine this bound to a sharp ..(., .) ≤ 4n – 8 – . – ., where . and . are the numbers of vertices in the rightmost vertex chai作者: 門窗的側(cè)柱 時間: 2025-3-23 11:31 作者: 相信 時間: 2025-3-23 17:41 作者: 耕種 時間: 2025-3-23 20:17 作者: FOLD 時間: 2025-3-24 01:34 作者: CLOWN 時間: 2025-3-24 06:05
https://doi.org/10.1007/978-3-642-91917-6BAR) trees are hierarchical space decomposition structures that are general-purpose and space-efficient, and, in addition, enjoy a worst case performance poly-logarithmic in the number of points for approximate queries. They maintain limits on their depth, as well as on the aspect ratio (intuitively作者: 侵害 時間: 2025-3-24 08:13 作者: 楓樹 時間: 2025-3-24 10:53 作者: exhibit 時間: 2025-3-24 15:28
https://doi.org/10.1007/978-3-642-94238-9 . with a positive real cost for every ., and a “coverage factor” (positive integer) .. A subset {.., ..,...}???. of elements are presented online in an arbitrary order. When each element .. is presented, we are also told the collection of all (at least .) sets . and their costs in which .. belongs 作者: 公司 時間: 2025-3-24 20:30
https://doi.org/10.1007/978-3-642-94238-9eir distance in .. If . has a tree .-spanner but not a tree (.–1)-spanner, then . is said to have max-stretch of .. In this paper, we study the Max-Stretch Reduction Problem: for an unweighted graph . = (.,.), find a set of edges not in . originally whose insertion into . can decrease the max-stretc作者: Progesterone 時間: 2025-3-25 02:53
Die Grundlagen des Dandysmus im Subjekt,ccinct if the asymptotic amount of space it uses matches the entropy of the class of structures represented..For the case of planar triangulations with a boundary we propose a succinct representation of the combinatorial information that improves to 2.175 bits per triangle the asymptotic amount of s作者: 白楊魚 時間: 2025-3-25 04:05
Die Grundlagen des Dandysmus im Subjekt, of graph edges, . denotes the size of the feedback vertex set searched for, and?. is a constant. As a second result, we present a fixed-parameter algorithm for the NP-complete . problem with runtime .(2. · ..).作者: 圓木可阻礙 時間: 2025-3-25 10:23 作者: Foolproof 時間: 2025-3-25 15:34
Die Grundlagen des Dandysmus im Subjekt,age, represented by the root of .. Each web page . carries a weight .. representative of the frequency with which it is visited. By adding hotlinks, shortcuts from a node to one of its descendents, we are interested in minimizing the expected number of steps needed to visit pages from the home page.作者: Insensate 時間: 2025-3-25 16:19
Die Grundlagen des Dandysmus im Subjekt, the plane, find a spanning tree of . of minimum “area,” where the area of a spanning tree . is the area of the union of the .–1 disks whose diameters are the edges in .. We prove that the Euclidean minimum spanning tree of . is a constant-factor approximation for .. We then apply this result to obt作者: FORGO 時間: 2025-3-25 21:02
Chronologie des Karikaturenstreits,hedron along identical faces. (Such joinings are possible only for reflectionally symmetric faces.) Each hinged dissection consists of a linear number of solid polyhedral pieces hinged along their edges to form a flexible closed chain (cycle). For each base polyhedron . and each positive integer ., 作者: 游行 時間: 2025-3-26 02:05 作者: admission 時間: 2025-3-26 04:59 作者: thwart 時間: 2025-3-26 09:11
https://doi.org/10.1007/11534273Computer; Triangulation; algorithmics; algorithms; approximation; calculus; combinatorial optimization; com作者: 細查 時間: 2025-3-26 16:41 作者: 大炮 時間: 2025-3-26 16:59 作者: 假 時間: 2025-3-26 23:59
0302-9743 Overview: 978-3-540-28101-6978-3-540-31711-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 大雨 時間: 2025-3-27 04:17
https://doi.org/10.1007/978-3-642-91917-6 testing algorithms, which identify the at most . items out of a given set of . items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information theoretic lower bound for the number of tests in a combinatorial group testing regimen.作者: Contort 時間: 2025-3-27 08:04
Die Grundlagen des Dandysmus im Subjekt, of graph edges, . denotes the size of the feedback vertex set searched for, and?. is a constant. As a second result, we present a fixed-parameter algorithm for the NP-complete . problem with runtime .(2. · ..).作者: FAR 時間: 2025-3-27 11:31
Improved Combinatorial Group Testing for Real-World Problem Sizes testing algorithms, which identify the at most . items out of a given set of . items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information theoretic lower bound for the number of tests in a combinatorial group testing regimen.作者: SKIFF 時間: 2025-3-27 14:59 作者: defeatist 時間: 2025-3-27 20:24 作者: 脖子 時間: 2025-3-27 22:03
Succinct Representation of Triangulations with a Boundarypace required and that supports the navigation between adjacent triangles in constant time (as well as other standard operations). For triangulations with . faces of a surface with genus ., our representation requires asymptotically an extra amount of 36(. - 1)lg . bits (which is negligible as long as .???./lg .).作者: 蕁麻 時間: 2025-3-28 02:33
,Die Ideen über das Metaphysische, much is gained in the worst case, although the classical problem of rebalancing an AVL tree can be solved efficiently, in particular rebalancing after vertex deletion requires .(log .) rotations as in the standard algorithm. Finding significant bounds and applications for . ≥ 3 is open.作者: FUSE 時間: 2025-3-28 09:58 作者: Tractable 時間: 2025-3-28 12:06 作者: 等級的上升 時間: 2025-3-28 15:24
Die Grundlagen des Dandysmus im Subjekt,ient data structure for maintaining hotlinks when nodes are added, deleted or their weights modified, in amortized time . per update. The data structure can be made adaptative, i.e. reaches the entropy bound in the amortized sense without knowing the weights .. in advance.作者: PACT 時間: 2025-3-28 19:47
Chronologie des Karikaturenstreits, 2D [7].Along the way, we present hinged dissections for polyplatonics (where . is a platonic solid) that are particularly efficient: among a type of hinged dissection, they use the fewest possible pieces.作者: 過剩 時間: 2025-3-29 02:27
k-Restricted Rotation with an Application to Search Tree Rebalancing much is gained in the worst case, although the classical problem of rebalancing an AVL tree can be solved efficiently, in particular rebalancing after vertex deletion requires .(log .) rotations as in the standard algorithm. Finding significant bounds and applications for . ≥ 3 is open.作者: 銀版照相 時間: 2025-3-29 04:30
Parameterized Counting Algorithms for General Graph Covering Problemsthe number of vertices in . and . is a simple polynomial. In order to achieve the additive relation between the polynomial and the non-polynomial parts of the time complexity of our algorithms, we use the compactor technique, the counting analogue of kernelization for parameterized decision problems.作者: audiologist 時間: 2025-3-29 10:34 作者: POWER 時間: 2025-3-29 13:15 作者: accrete 時間: 2025-3-29 17:04 作者: 不能逃避 時間: 2025-3-29 20:33 作者: Amnesty 時間: 2025-3-30 01:20 作者: opportune 時間: 2025-3-30 05:40
Die Grundlagen des Dandysmus im Subjekt, average pairwise .. distance. We present a natural approximation algorithm and show that it is a .-approximation for 2D grids. In . dimensions, the approximation guarantee is 2 - ., which is tight. We also give a polynomial-time approximation scheme (PTAS) for constant dimension . and report on experimental results.作者: ASSET 時間: 2025-3-30 08:54 作者: entice 時間: 2025-3-30 13:21 作者: facetious 時間: 2025-3-30 19:31 作者: 分散 時間: 2025-3-30 23:34
Technische Grundlagen des Mobilfunks, in the trie, and . is the entropy of the source. We use this formula to compare performance of known adaptive trie structures, and to predict properties of other possible implementations of tries in this class.作者: Misnomer 時間: 2025-3-31 04:46
Die Grundlagen des Dandysmus im Subjekt,he Minimum-Area Tour (.) problem. The first problem is a variant of the power assignment problem in radio networks, the second problem is a related natural problem, and the third problem is a variant of the traveling salesman problem.作者: placebo-effect 時間: 2025-3-31 05:22 作者: MARS 時間: 2025-3-31 11:42 作者: Angiogenesis 時間: 2025-3-31 16:16
https://doi.org/10.1007/978-3-642-46941-1roblems. Interestingly, although the considered generalized . problems behave very similar in terms of constant-factor approximability, they display a wide range of different characteristics when investigating their parameterized complexities.作者: 帶來墨水 時間: 2025-3-31 19:48
Die Grundlagen des Dandysmus im Subjekt,pace required and that supports the navigation between adjacent triangles in constant time (as well as other standard operations). For triangulations with . faces of a surface with genus ., our representation requires asymptotically an extra amount of 36(. - 1)lg . bits (which is negligible as long as .???./lg .).作者: 虛情假意 時間: 2025-3-31 22:18
Towards a Theory of Algorithmsbacktracking, dynamic programming, divide and conquer, local search, primal-dual, etc. (but not etc. etc.). We seem to be able to intuitively describe what we have in mind when we discuss these classes of algorithms but rarely (if ever) do we attempt to define precisely what we mean by such terms as作者: Mortal 時間: 2025-4-1 04:24
k-Restricted Rotation with an Application to Search Tree Rebalancing only take place at the root of the tree, or at the right child of the root. A sharp upper bound ..(., .) ≤ 4n – 8 is known, based on the word metric of Thompson’s group. We refine this bound to a sharp ..(., .) ≤ 4n – 8 – . – ., where . and . are the numbers of vertices in the rightmost vertex chai作者: 特征 時間: 2025-4-1 07:19
