標題: Titlebook: Algorithms and Data Structures; 10th International W Frank Dehne,J?rg-Rüdiger Sack,Norbert Zeh Conference proceedings 2007 Springer-Verlag [打印本頁] 作者: 迅速 時間: 2025-3-21 17:23
書目名稱Algorithms and Data Structures影響因子(影響力)
書目名稱Algorithms and Data Structures影響因子(影響力)學科排名
書目名稱Algorithms and Data Structures網(wǎng)絡公開度
書目名稱Algorithms and Data Structures網(wǎng)絡公開度學科排名
書目名稱Algorithms and Data Structures被引頻次
書目名稱Algorithms and Data Structures被引頻次學科排名
書目名稱Algorithms and Data Structures年度引用
書目名稱Algorithms and Data Structures年度引用學科排名
書目名稱Algorithms and Data Structures讀者反饋
書目名稱Algorithms and Data Structures讀者反饋學科排名
作者: cliche 時間: 2025-3-21 23:57
Approximate Range Searching: The Absolute Modelpproximation parameter .>?0 is provided. Most prior work on this problem has focused on the case of relative errors, where each range shape . is bounded, and points within distance . of the range’s boundary may or may not be included. We consider a different approximation model, called the ., in whi作者: Obliterate 時間: 2025-3-22 01:11
Orthogonal Range Searching in Linear and Almost-Linear Spacee that supports orthogonal range reporting queries in .(log.?+?.log..) time, where . is the size of the answer. Our data structure also supports emptiness and one-reporting queries in .(log.) time and thus achieves optimal time and space for this type of queries. In the case of integer point coordin作者: 歡笑 時間: 2025-3-22 08:32
Spherical LSH for Approximate Nearest Neighbor Search on Unit Hyperspherehis paper presents a variant of the LSH algorithm, focusing on the special case of where all points in the dataset lie on the surface of the unit hypersphere in a .-dimensional Euclidean space. The LSH scheme is based on a family of hash functions that preserves locality of points. This paper points作者: flaunt 時間: 2025-3-22 12:38 作者: ethereal 時間: 2025-3-22 13:05
The Stackelberg Minimum Spanning Tree Gamered either red or blue, and where the red edges have a given fixed cost (representing the competitor’s prices). The first player chooses an assignment of prices to the blue edges, and the second player then buys the cheapest possible minimum spanning tree, using any combination of red and blue edges作者: GILD 時間: 2025-3-22 18:03 作者: 轉(zhuǎn)換 時間: 2025-3-22 23:52 作者: 內(nèi)疚 時間: 2025-3-23 02:38
Drawing Colored Graphs on Colored Pointsf . distinct points in the plane partitioned into subsets .., ..., .. with |..|?=?|..| (0?≤?.?≤?.???1). This paper studies the problem of computing a crossing-free drawing of . such that each vertex of .. is mapped to a distinct point of ... Lower and upper bounds on the number of bends per edge are作者: exorbitant 時間: 2025-3-23 09:29 作者: Explicate 時間: 2025-3-23 12:26 作者: Prosaic 時間: 2025-3-23 14:16
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane.), where . denotes the number of terminals plus obstacle vertices. To this end, we show how a planar spanner of size .(. log.) can be constructed that contains a (1?+?.)-approximation of the optimal tree. Then one can find an approximately optimal Steiner tree in the spanner using the algorithm of 作者: ALIEN 時間: 2025-3-23 21:21
A Pseudopolynomial Time ,(log,)-Approximation Algorithm for Art Gallery Problemstime polynomial in ., the number of walls of the art gallery and the spread ., which is defined as the ratio between the longest and shortest pairwise distances. Our algorithm is pseudopolynomial in the sense that it is polynomial in the spread . as opposed to polylogarithmic in the spread ., which 作者: 積云 時間: 2025-3-23 22:51
Optimization for First Order Delaunay Triangulations-adjacent or vertex-adjacent triangles instead of only to single triangles. We give efficient algorithms to optimize certain measures, whereas other measures are shown to be NP-hard. For two of the NP-hard maximization problems we provide for any constant .>?0, factor (1???.) approximation algorithm作者: 現(xiàn)實 時間: 2025-3-24 04:19 作者: 高爾夫 時間: 2025-3-24 07:33 作者: Graduated 時間: 2025-3-24 12:44 作者: 過分 時間: 2025-3-24 18:53 作者: Directed 時間: 2025-3-24 19:01 作者: disciplined 時間: 2025-3-25 02:52
Kinderszenen: Irrationales in der Musik,e that supports orthogonal range reporting queries in .(log.?+?.log..) time, where . is the size of the answer. Our data structure also supports emptiness and one-reporting queries in .(log.) time and thus achieves optimal time and space for this type of queries. In the case of integer point coordin作者: 高興去去 時間: 2025-3-25 03:41 作者: 詼諧 時間: 2025-3-25 08:48
,Die Durchführung des Pauli-Tests,r of the graph, with the constraint that all paths have both endpoints in the second node layer and no node in that layer is covered more than once. . is equivalent to the .... that arises in the design of molecular quantum-dot cellular automata (QCA) circuits and the physical synthesis of BDD based作者: genuine 時間: 2025-3-25 11:41
Uta Rohrschneider,Michael Lorenzred either red or blue, and where the red edges have a given fixed cost (representing the competitor’s prices). The first player chooses an assignment of prices to the blue edges, and the second player then buys the cheapest possible minimum spanning tree, using any combination of red and blue edges作者: 受辱 時間: 2025-3-25 17:36
Uta Rohrschneider,Michael Lorenz and interrupts the lower edge in an appropriate neighborhood of the crossing. Certain orders will lead to a more readable drawing than others. We formulate several optimization criteria that try to capture the concept of a “good” cased drawing. Further, we address the algorithmic question of how to作者: 預測 時間: 2025-3-25 21:22 作者: 實現(xiàn) 時間: 2025-3-26 00:22 作者: Statins 時間: 2025-3-26 07:04
https://doi.org/10.1007/978-3-663-13587-6of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we introduce a resilient priority queue. The deletemin operation of a resilient priority queue returns either the minimum uncorrupted element or some cor作者: 高爾夫 時間: 2025-3-26 10:48 作者: pulse-pressure 時間: 2025-3-26 14:08 作者: 斜 時間: 2025-3-26 20:53 作者: 上腭 時間: 2025-3-27 00:28 作者: Implicit 時間: 2025-3-27 02:12 作者: 金絲雀 時間: 2025-3-27 06:44
https://doi.org/10.1007/978-3-662-42569-5, and there is a polynomial time algorithm to find one. However, the matching obtained by this algorithm is man-optimal, that is, the matching is preferable for men but unpreferable for women, (or, if we exchange the role of men and women, the resulting matching is woman-optimal). The sex-equal stab作者: 基因組 時間: 2025-3-27 09:59
Der Phasenkompensator, Bauart Brown-Boveri, of . and integer . with 1?≤?.?≤?., find a size . sub-collection (.′., .′., ..., .′.) of . that minimizes .(.′. * .′. *???* .′.). If .(. * .)?≤?.(.)?+?.(.) holds, we call this the Minimum Subadditive Join (MSJ) problem and present a greedy (.???.?+?1)-approximation algorithm requiring .((.???.).?+?.作者: Synapse 時間: 2025-3-27 15:24 作者: Bother 時間: 2025-3-27 18:10
https://doi.org/10.1007/978-3-663-13587-6This paper studies a discrepancy-sensitive approach to dynamic fractional cascading. We provide an efficient data structure for dominated maxima searching in a dynamic set of points in the plane, which in turn leads to an efficient dynamic data structure that can answer queries for nearest neighbors using any Minkowski metric.作者: 婚姻生活 時間: 2025-3-28 00:23
A 4/3-Approximation Algorithm for Minimum 3-Edge-ConnectivityThe minimum cardinality 3-edge-connected spanning subgraph problem is considered. An approximation algorithm with a performance ratio of 4/3?≈?1.33 is presented. This improves the previous best ratio of 3/2 for the problem. The algorithm also works on multigraphs and guarantees the same approximation ratio.作者: 無法取消 時間: 2025-3-28 04:46 作者: 妨礙議事 時間: 2025-3-28 07:12 作者: 搖晃 時間: 2025-3-28 11:44 作者: 值得贊賞 時間: 2025-3-28 18:22
Algorithms and Data Structures978-3-540-73951-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: AXIS 時間: 2025-3-28 19:48
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153157.jpg作者: EPT 時間: 2025-3-28 23:27
Approximate Range Searching: The Absolute Model to improve not only approximate, but also exact halfspace range searching. Our data structures are much simpler than both their exact and relative model counterparts, and so are amenable to efficient implementation.作者: 明確 時間: 2025-3-29 04:36 作者: 翅膀拍動 時間: 2025-3-29 07:33
Approximation Algorithms for the Sex-Equal Stable Marriage Problemmizing additional criterion: among stable matchings that are near optimal in terms of the sex-equality, find a minimum egalitarian stable matching. We show that this problem is NP-hard, and give a polynomial time algorithm whose approximation ratio is less than two.作者: Kaleidoscope 時間: 2025-3-29 11:28 作者: 弓箭 時間: 2025-3-29 15:45
https://doi.org/10.1007/978-3-658-40192-4 to improve not only approximate, but also exact halfspace range searching. Our data structures are much simpler than both their exact and relative model counterparts, and so are amenable to efficient implementation.作者: 友好關系 時間: 2025-3-29 20:11
Uta Rohrschneider,Michael Lorenz {.,3?+?2ln .,1?+?ln .}, where . is the number of distinct red costs, . is the number of blue edges, and . is the maximum ratio between red costs. We also give a natural integer linear programming formulation of the problem, and show that the integrality gap of the fractional relaxation asymptotical作者: 仔細檢查 時間: 2025-3-30 02:33 作者: 完全 時間: 2025-3-30 05:53
Conference proceedings 2007swho submitted papers, andthe manyreferees who assisted the Program Committee. We are indebted to Gerardo Reynaga for installing and modifying the submission software, maintaining the submission server and interacting with authors as well as for helping with the preparation of the program.作者: overhaul 時間: 2025-3-30 09:26
0302-9743 15 - 17, 2007, at Dalhousie University, Halifax, Canada. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the t- dition of SWAT and WADS starting with SWAT 1988 and WADS 1989. From 142 submissions, the Program Committee selected 54 papers for presentation作者: 笨拙處理 時間: 2025-3-30 14:40 作者: FEMUR 時間: 2025-3-30 20:20 作者: 抗生素 時間: 2025-3-30 23:09
Edges and Switches, Tunnels and Bridgesmulate several optimization criteria that try to capture the concept of a “good” cased drawing. Further, we address the algorithmic question of how to turn a given drawing into an optimal cased drawing. For many of the resulting optimization problems, we either find polynomial time algorithms or NP-hardness results.作者: 依法逮捕 時間: 2025-3-31 01:17
Drawing Colored Graphs on Colored Pointscrossing-free drawing of . such that each vertex of .. is mapped to a distinct point of ... Lower and upper bounds on the number of bends per edge are proved for any 3?≤?.?≤?.. As a special case, we improve the upper and lower bounds presented in a paper by Pach and Wenger for .?=?. [. (2001), 17:717–728].作者: 蛙鳴聲 時間: 2025-3-31 05:08
Approximating the Maximum Sharing Problem regular circuit structures in VLSI design. We show that MS is NP-hard, present a polynomial-time 1.5-approximation algorithm, and show that . cannot be approximated with a factor better than . unless .?=?..作者: dandruff 時間: 2025-3-31 12:54
Simple and Space-Efficient Minimal Perfect Hash Functionsalgorithm in the literature with the third property either: .Thus, our main contribution is a scheme that gives low space usage for realistic values of .. The main technical ingredient is a new way of basing PHFs on random hypergraphs. Previously, this approach has been used to design simple PHFs with superlinear space usage.作者: folliculitis 時間: 2025-3-31 15:01
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the PlaneBorradaile et al. (2007) for the Steiner tree problem in planar graphs. We prove this result for the Euclidean metric and also for all uniform orientation metrics, i.e. particularly the rectilinear and octilinear metrics.作者: Femish 時間: 2025-3-31 21:30 作者: 大猩猩 時間: 2025-3-31 22:31 作者: conjunctivitis 時間: 2025-4-1 03:58
,Der Europ?ische Bürgerbeauftragte,Borradaile et al. (2007) for the Steiner tree problem in planar graphs. We prove this result for the Euclidean metric and also for all uniform orientation metrics, i.e. particularly the rectilinear and octilinear metrics.作者: DEI 時間: 2025-4-1 09:23 作者: 得罪 時間: 2025-4-1 14:06 作者: 火花 時間: 2025-4-1 17:11
,über dunkle Aspekte der Naturwissenschaft,ciently than the previously proposed methods. The design of these hash functions uses randomly rotated regular polytopes and it partitions the surface of the unit hypersphere like a Voronoi diagram. Our new scheme improves the exponent ., the main indicator of the performance of the LSH algorithm.作者: photopsia 時間: 2025-4-1 19:34 作者: Resistance 時間: 2025-4-2 01:07 作者: HEDGE 時間: 2025-4-2 06:08 作者: 開始發(fā)作 時間: 2025-4-2 09:34 作者: 收藏品 時間: 2025-4-2 11:36
