標題: Titlebook: Algorithms and Data Structures; 12th International S Frank Dehne,John Iacono,J?rg-Rüdiger Sack Conference proceedings 2011 Springer-Verlag [打印本頁] 作者: Dangle 時間: 2025-3-21 18:02
書目名稱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讀者反饋學科排名
作者: Magnitude 時間: 2025-3-21 22:25 作者: pulse-pressure 時間: 2025-3-22 01:22
On the Area Requirements of Euclidean Minimum Spanning Trees,uclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that .. ×.. area is sometimes required to embed an .-vertex tree of maximum degree 5 as a Euclidean minimum spanning tree, for some constant .?>?1. In this paper, we prove th作者: 笨拙處理 時間: 2025-3-22 06:11 作者: acetylcholine 時間: 2025-3-22 11:02 作者: Cocker 時間: 2025-3-22 16:32
How to Cover a Point Set with a V-Shape of Minimum Width,lel rays that emanate from two points ., ., are contained in the strip boundaries, and are mirror-symmetric with respect to the line .. The width of a balanced V-shape is the width of the strips..We first present an .(.. log.) time algorithm to compute, given a set of .?points ., a minimum-width bal作者: 舊式步槍 時間: 2025-3-22 19:38
Witness Rectangle Graphs, . and . as opposite corners contains at least one point in .. WRGs are representative of a larger family of witness proximity graphs introduced in two previous papers..We study graph-theoretic properties of WRGs. We prove that any WRG has at most two non-trivial connected components. We bound the d作者: PURG 時間: 2025-3-22 22:45 作者: 遺忘 時間: 2025-3-23 04:42 作者: TOXIN 時間: 2025-3-23 06:59 作者: 平淡而無味 時間: 2025-3-23 10:58 作者: 藕床生厭倦 時間: 2025-3-23 16:17
Adjacency-Preserving Spatial Treemaps,ce in rectangular cartograms in which the rectangles represent geographic or political regions. A . is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn subdivided into smaller rectangles. We describe algorithms for transforming a 作者: 確定方向 時間: 2025-3-23 18:31 作者: cacophony 時間: 2025-3-24 01:07 作者: 令人作嘔 時間: 2025-3-24 06:07 作者: 蚊帳 時間: 2025-3-24 09:29 作者: 大暴雨 時間: 2025-3-24 14:41 作者: albuminuria 時間: 2025-3-24 18:12
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance,adius 1, can be replaced by a strongly connected communication graph, in which each transceiver in . is equipped with a directional antenna of angle . and radius ., for some constant .. Moreover, the new communication graph is a .-spanner of the original graph, for some constant .?=?.(.), with respect to number of hops.作者: 植物茂盛 時間: 2025-3-24 19:16
Multicut in Trees Viewed through the Eyes of Vertex Cover,s us to significantly improve the .(..) upper bound on the kernel size for ., given by Bousquet et al., to .(..). We exploit this connection further to present a parameterized algorithm for . that runs in time ..(..), where .. This improves the previous (time) upper bound of ..(2.), given by Guo and Niedermeier, for the problem.作者: incarcerate 時間: 2025-3-25 02:59
https://doi.org/10.1007/978-3-642-22300-6DNA synthesis; approximation algorithms; knapsack problem; randomized algorithm; wireless networks; algor作者: Credence 時間: 2025-3-25 03:28 作者: FOR 時間: 2025-3-25 11:33
Zusammenfassung und Perspektiven,We give an algorithm to create orthogonal drawings of 3-connected 3-regular planar graphs such that each interior face of the graph is drawn with a prescribed area. This algorithm produces a drawing with at most 12 corners per face and 4 bends per edge, which improves the previous known result of 34 corners per face.作者: Type-1-Diabetes 時間: 2025-3-25 11:46 作者: cathartic 時間: 2025-3-25 16:12
Orthogonal Cartograms with Few Corners Per Face,We give an algorithm to create orthogonal drawings of 3-connected 3-regular planar graphs such that each interior face of the graph is drawn with a prescribed area. This algorithm produces a drawing with at most 12 corners per face and 4 bends per edge, which improves the previous known result of 34 corners per face.作者: perjury 時間: 2025-3-25 23:56
Feedback Vertex Set in Mixed Graphs,A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph on . vertices contains a feedback vertex set (FVS) of size at most ., in time .(47.5. ·.! ·..). This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs.作者: Agility 時間: 2025-3-26 01:23 作者: PRE 時間: 2025-3-26 05:57
Zusammenfassung und Perspektiven,... Equivalently, it is the minimum number of interval graphs on the vertex set . such that the intersection of their edge sets is .. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below .(..)-factor, for any .?>?0 in polynomial 作者: Heart-Attack 時間: 2025-3-26 08:45
Entstehung und Entwicklung des Konflikts,uclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that .. ×.. area is sometimes required to embed an .-vertex tree of maximum degree 5 as a Euclidean minimum spanning tree, for some constant .?>?1. In this paper, we prove th作者: 愛了嗎 時間: 2025-3-26 15:07 作者: Engaged 時間: 2025-3-26 20:35 作者: 含糊其辭 時間: 2025-3-27 00:04
https://doi.org/10.1007/978-3-531-93303-0lel rays that emanate from two points ., ., are contained in the strip boundaries, and are mirror-symmetric with respect to the line .. The width of a balanced V-shape is the width of the strips..We first present an .(.. log.) time algorithm to compute, given a set of .?points ., a minimum-width bal作者: Anemia 時間: 2025-3-27 01:30 作者: PET-scan 時間: 2025-3-27 05:27
Entstehung und Entwicklung des Konflikts,mand has only one non-zero value (the .), and the non-zeroes in each row are consecutive. This has direct applications in intensity-modulated radiation therapy, an effective form of cancer treatment..We study here the special case when the largest value . in the intensity matrix is small. We show th作者: 鼓掌 時間: 2025-3-27 11:54 作者: 光亮 時間: 2025-3-27 15:11
Heinrich Kraut,Ernst Kofrányi,Willi Wirthsadius 1, can be replaced by a strongly connected communication graph, in which each transceiver in . is equipped with a directional antenna of angle . and radius ., for some constant .. Moreover, the new communication graph is a .-spanner of the original graph, for some constant .?=?.(.), with respe作者: flutter 時間: 2025-3-27 18:43
Regulierung der Nahrungsaufnahmeser. Each advertiser can be assigned at most .. units in all, and at most .. units from the same user. The goal is to design an online allocation algorithm maximizing total value..We first show a deterministic upper bound of 3/4-competitiveness, even when all frequency caps are 1, and all advertiser作者: 壕溝 時間: 2025-3-28 01:52
https://doi.org/10.1007/978-3-642-72338-4ce in rectangular cartograms in which the rectangles represent geographic or political regions. A . is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn subdivided into smaller rectangles. We describe algorithms for transforming a 作者: Morbid 時間: 2025-3-28 02:35
Fruchts?fte, Limonaden, Brauselimonadenhave one “memory bank requirement”, an integer. There are . “registers”, labeled 1 ….. A valid solution associates to the vertices with no bank requirement one or more “l(fā)oad instructions” .[.,.], for bank . and register ., such that every directed trail from the start vertex to some vertex with bank作者: 構(gòu)想 時間: 2025-3-28 07:20 作者: gait-cycle 時間: 2025-3-28 12:21
https://doi.org/10.1007/978-3-642-92055-4Euclidean space. Their algorithm requires one pass, uses .(.) space, and was shown to have approximation factor at most .. We prove that the same algorithm has approximation factor less than 1.22, which brings us much closer to a . lower bound given by Agarwal and Sharathkumar..We also apply this te作者: Benzodiazepines 時間: 2025-3-28 18:10
https://doi.org/10.1007/978-3-642-46152-1ility at its position, and an integer ., we seek to find at most . of the customers to set up facilities for serving all . customers such that the total cost for facility set-up and service transportation is minimized. We consider several problem variations including .-median and .-coverage and a li作者: 最后一個 時間: 2025-3-28 21:55 作者: 啟發(fā) 時間: 2025-3-28 22:59
Algorithms and Data Structures978-3-642-22300-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 中古 時間: 2025-3-29 03:08
Heinrich Kraut,Ernst Kofrányi,Willi Wirthsadius 1, can be replaced by a strongly connected communication graph, in which each transceiver in . is equipped with a directional antenna of angle . and radius ., for some constant .. Moreover, the new communication graph is a .-spanner of the original graph, for some constant .?=?.(.), with respect to number of hops.作者: micturition 時間: 2025-3-29 11:11 作者: 牲畜欄 時間: 2025-3-29 14:18
Frank Dehne,John Iacono,J?rg-Rüdiger SackFast track conference proceedings.Unique visibility.State of the art research作者: CHOKE 時間: 2025-3-29 18:14
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153148.jpg作者: Glucose 時間: 2025-3-29 23:31
Zusammenfassung und Perspektiven,ation, where .?≥?1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is .(.?+?..) in both these cases and in .(.?+?..) which 作者: neolith 時間: 2025-3-30 01:03
Entstehung und Entwicklung des Konflikts,achieves optimal competitive ratio under this metric. The second measure is based on a weakening of the optimal cost as proposed by Kirkpatrick [ESA 2009] and McGregor . [ESA 2009]. For this model, we present an asymptotically optimal strategy which is within a multiplicative factor of Θ(log(.???.))作者: 去世 時間: 2025-3-30 07:56 作者: 可忽略 時間: 2025-3-30 09:37
Fruchts?fte, Limonaden, Brauselimonaden(. log.) approximation, with . being the number of vertices in the input directed graph. Based on the same linear program, another rounding method outputs a valid solution with objective at most 2. times the optimum for . registers, using 2. registers.作者: Catheter 時間: 2025-3-30 16:17 作者: kyphoplasty 時間: 2025-3-30 19:00 作者: 刺激 時間: 2025-3-30 22:26 作者: PUT 時間: 2025-3-31 04:34 作者: Indelible 時間: 2025-3-31 07:52 作者: 撫育 時間: 2025-3-31 09:27
https://doi.org/10.1007/978-3-531-91561-6analyses of Dyer and Frieze’s partitioning algorithm for Euclidean matching, Karp’s partitioning scheme for the TSP, a heuristic for Steiner trees, and a heuristic for degree-bounded minimum-length spanning trees.作者: evasive 時間: 2025-3-31 16:56 作者: largesse 時間: 2025-3-31 17:44 作者: 半身雕像 時間: 2025-3-31 23:17
https://doi.org/10.1007/978-3-642-46152-1near model. We also study a related path equipartition problem: Given a vertex-weighted path and an integer ., remove .???1 edges so that the weights of the resulting . sub-paths are as equal as possible. Based on new problem modeling and observations, we present improved algorithms for these problems over the previous work.作者: 綠州 時間: 2025-4-1 02:02 作者: VALID 時間: 2025-4-1 09:44
Entstehung und Entwicklung des Konflikts,over the previous best FPT algorithm. We also show how to solve the full-matrix problem faster than all previously known algorithms. Finally, we address a closely related problem that deals with minimizing the number of segments subject to a minimum ., defined as the sum of the segment-values. Here, we obtain an almost-quadratic speedup.
