標題: Titlebook: Algorithms and Computation; 4th International Sy K. W. Ng,P. Raghavan,F. Y. L. Chin Conference proceedings 1993 Springer-Verlag Berlin Heid [打印本頁] 作者: melancholy 時間: 2025-3-21 17:45
書目名稱Algorithms and Computation影響因子(影響力)
書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Computation被引頻次
書目名稱Algorithms and Computation被引頻次學(xué)科排名
書目名稱Algorithms and Computation年度引用
書目名稱Algorithms and Computation年度引用學(xué)科排名
書目名稱Algorithms and Computation讀者反饋
書目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: 形容詞 時間: 2025-3-21 22:36 作者: 勾引 時間: 2025-3-22 04:12
Die Kreiselwirkungen bei Rads?tzenplane region ., each connecting a terminal pair without passing through any obstacles, whose total length is minimum. Non-crossing paths may share common points or line segments but do not cross each other in the plane. The algorithm runs in time . log .) where ..作者: 合唱團 時間: 2025-3-22 05:49 作者: 中和 時間: 2025-3-22 10:49
Constructing degree-3 spanners with other sparseness properties,(where . is a constant that depends only on . and .) with the following properties. Its maximum degree is 3, it has at most . · . edges, and its total edge weight is comparable to the minimum spanning tree of . (for . ≤ 3 its weight is .(1) · ., and for .>3 its weight is .(log .) · ..作者: 執(zhí)拗 時間: 2025-3-22 14:11 作者: Mediocre 時間: 2025-3-22 18:40 作者: nautical 時間: 2025-3-22 22:29
Rudolf Klu?mann (Leiter),Berthold Emmerichor to be deleted by the next deletion. We apply our general technique to obtain new and efficient algorithms for dynamically maintaining arrangements of line segments, lower envelopes of triangles, convex hulls and Voronoi diagrams of points in any dimension, and Voronoi diagrams of line segments in a plane.作者: infatuation 時間: 2025-3-23 01:35 作者: 高腳酒杯 時間: 2025-3-23 05:41 作者: COLIC 時間: 2025-3-23 12:47
https://doi.org/10.1007/978-3-642-86145-1l reconfigurable buses. In this paper, we present lower bounds and nearly matching upper bounds for packet routing on these two models. As a consequence, we solve two of the open problems mentioned in [15].作者: Fabric 時間: 2025-3-23 15:49 作者: HEPA-filter 時間: 2025-3-23 18:54
Remembering conflicts in history yields dynamic algorithms,or to be deleted by the next deletion. We apply our general technique to obtain new and efficient algorithms for dynamically maintaining arrangements of line segments, lower envelopes of triangles, convex hulls and Voronoi diagrams of points in any dimension, and Voronoi diagrams of line segments in a plane.作者: Progesterone 時間: 2025-3-24 01:29 作者: cravat 時間: 2025-3-24 03:04 作者: 燦爛 時間: 2025-3-24 09:18 作者: GILD 時間: 2025-3-24 12:45 作者: syring 時間: 2025-3-24 18:45 作者: 撕裂皮肉 時間: 2025-3-24 22:22 作者: 亂砍 時間: 2025-3-25 02:38 作者: insolence 時間: 2025-3-25 03:59
Begleitung sterbender Krebspatientenf the shortest path from . to . in the spanner is at most . times .. We show that for any .>1, there exists a polynomial-time constructible .-spanner (where . is a constant that depends only on . and .) with the following properties. Its maximum degree is 3, it has at most . · . edges, and its total作者: 軍火 時間: 2025-3-25 08:41
Rudolf Klu?mann (Leiter),Berthold Emmerichcheme to obtain dynamic algorithms which is based on the abstract setting introduced by Clarkson and Shor. This scheme uses a novel data structure that combines the conflict graph and the history structure used by incremental algorithms. The randomized analysis of the dynamic algorithms assumes a pr作者: ASSET 時間: 2025-3-25 13:19
https://doi.org/10.1007/978-3-642-99750-1 give algorithms for coloring random graphs in these models, with running times polynomial on the average. The first model is discussed in Turner [6] and the second model is discussed in Dyer and Frieze [3]. Our results improve the these current results for this problem by removing the assumption of作者: 簡潔 時間: 2025-3-25 17:49
https://doi.org/10.1007/978-3-642-99750-1-connected graphical degree sequence problem is: Given a sequence . of integers, determine whether it is .-connected graphical or not, and, if so, construct a graph with . as its degree sequence. In this paper, we consider the .-connected graphical degree sequence problem and present an . log log .)作者: pulse-pressure 時間: 2025-3-25 22:15
Die Kreiselwirkungen bei Rads?tzens lie on the outer and inner rectangular boundaries. This paper presents an efficient algorithm which finds . “non-crossing” rectilinear paths in the plane region ., each connecting a terminal pair without passing through any obstacles, whose total length is minimum. Non-crossing paths may share com作者: 下級 時間: 2025-3-26 00:12 作者: 發(fā)生 時間: 2025-3-26 04:59 作者: fiction 時間: 2025-3-26 09:03
Beschreibung des Einkreiselkompasses,wing amortized time bounds: .(1) for ., and . operations, and .(logn) for ., arbitrary ., and . operations. An .-node d-b-queue can be constructed in 1.75. comparisons. Our results include a simple proof of .(1) amortized time merging for ordinary binomial queues.作者: drusen 時間: 2025-3-26 13:14
Beschreibung des Einkreiselkompasses,st-case time (once the position of the inserted or deleted key is known). Our data structure is quite natural and much simpler than previous worst-case optimal solutions. It is based on two techniques: 1) ., i.e. storing an ordered list of 2log . keys in each leaf of an (.) tree, and 2) ., i.e. post作者: Harrowing 時間: 2025-3-26 20:08
Spannungskollaps (Zentralisation),ijn graphs, and product networks such as (generalized) hypercube, hyper-de Bruijn, hyper Petersen, folded Petersen and product-shuffle networks..Our results are important in mapping data and algorithm structures into multiprocessor interconnection networks. Tree embeddings can be used to maintain dy作者: cauda-equina 時間: 2025-3-26 23:59 作者: BILIO 時間: 2025-3-27 01:13 作者: exostosis 時間: 2025-3-27 08:17
https://doi.org/10.1007/978-3-8350-5467-7re given this is the well known lattice approximation problem. We call the general version the quadratic lattice approximation problem. In this paper we construct via derandomization lattice points with small linear and quadratic discrepancies. Unfortunately the known derandomization methods do not 作者: nostrum 時間: 2025-3-27 11:58
https://doi.org/10.1007/978-3-642-75831-7We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its actual movement will be confined in a cone of angle . centered around the specified direction.作者: Obverse 時間: 2025-3-27 16:44 作者: avulsion 時間: 2025-3-27 17:55 作者: Gossamer 時間: 2025-3-27 23:26
Reaching a goal with directional uncertainty,We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its actual movement will be confined in a cone of angle . centered around the specified direction.作者: 本能 時間: 2025-3-28 02:21
Finding the shortest watchman route in a simple polygon,We present the first polynomial-time algorithm that finds the shortest route in a simple polygon such that all points of the polygon is visible from some point on the route. This route is sometimes called the shortest watchman route, and it does not allow any restrictions on the route or on the simple polygon. Our algorithm runs in ..) time.作者: 取回 時間: 2025-3-28 08:27
Constructing shortest watchman routes by divide-and-conquer,We study the problem of finding shortest watchman routes in simple polygons from which polygons are visible. We develop a divide-and-conquer algorithm that constructs the shortest watchman route in ..) time for a simple polygon with . edges. This improves the previous ..) bound [8] and confirms a conjecture due to Chin and Ntafos [4].作者: 阻塞 時間: 2025-3-28 12:46 作者: Confirm 時間: 2025-3-28 14:53 作者: STENT 時間: 2025-3-28 19:57
Treewidth of circle graphs,ersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number. Our algorithm to determine the treewidth of a circle graph can be implemented to run in ..) time, where . is the number of vertices of the graph.作者: Anthology 時間: 2025-3-28 23:52
Double-ended binomial queues,wing amortized time bounds: .(1) for ., and . operations, and .(logn) for ., arbitrary ., and . operations. An .-node d-b-queue can be constructed in 1.75. comparisons. Our results include a simple proof of .(1) amortized time merging for ordinary binomial queues.作者: Microgram 時間: 2025-3-29 04:46
Adaptive and oblivious algorithms for d-cube permutation routing, 7 (called 7-cube). We also prove an ./log .) lower bound for the class of deterministic restricted oblivious permutation routing algorithms. Finally, we design optimal deterministic oblivious permutation routing on the .-cube, . ≤ 6.作者: 沒花的是打擾 時間: 2025-3-29 11:13 作者: facetious 時間: 2025-3-29 14:25
https://doi.org/10.1007/3-540-57568-5AAC; Algorithms; Automat; DOM; algorithm; automata; complexity; computability; robot; robotics; combinatorics作者: Amorous 時間: 2025-3-29 18:12 作者: Adjourn 時間: 2025-3-29 22:51 作者: onlooker 時間: 2025-3-30 00:08 作者: 預(yù)感 時間: 2025-3-30 06:39 作者: 虛構(gòu)的東西 時間: 2025-3-30 11:50
https://doi.org/10.1007/978-3-662-30589-8ersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number. Our algorithm to determine the treewidth of a circle graph can be implemented to run in ..) time, where . is the number of vertices of the graph.作者: projectile 時間: 2025-3-30 14:59
Beschreibung des Einkreiselkompasses,wing amortized time bounds: .(1) for ., and . operations, and .(logn) for ., arbitrary ., and . operations. An .-node d-b-queue can be constructed in 1.75. comparisons. Our results include a simple proof of .(1) amortized time merging for ordinary binomial queues.作者: 去才蔑視 時間: 2025-3-30 19:03
https://doi.org/10.1007/978-3-8350-5467-7 7 (called 7-cube). We also prove an ./log .) lower bound for the class of deterministic restricted oblivious permutation routing algorithms. Finally, we design optimal deterministic oblivious permutation routing on the .-cube, . ≤ 6.作者: 作嘔 時間: 2025-3-30 21:54 作者: Frequency 時間: 2025-3-31 02:29 作者: Ligament 時間: 2025-3-31 06:43
Coloring random graphs in polynomial expected time, give algorithms for coloring random graphs in these models, with running times polynomial on the average. The first model is discussed in Turner [6] and the second model is discussed in Dyer and Frieze [3]. Our results improve the these current results for this problem by removing the assumption of作者: 里程碑 時間: 2025-3-31 10:14
Graphical degree sequence problems with connectivity requirements,-connected graphical degree sequence problem is: Given a sequence . of integers, determine whether it is .-connected graphical or not, and, if so, construct a graph with . as its degree sequence. In this paper, we consider the .-connected graphical degree sequence problem and present an . log log .)作者: 詞匯記憶方法 時間: 2025-3-31 16:49
Finding shortest non-crossing rectilinear paths in plane regions,s lie on the outer and inner rectangular boundaries. This paper presents an efficient algorithm which finds . “non-crossing” rectilinear paths in the plane region ., each connecting a terminal pair without passing through any obstacles, whose total length is minimum. Non-crossing paths may share com作者: 單挑 時間: 2025-3-31 21:34 作者: gratify 時間: 2025-4-1 01:40
A framework for constructing heap-like structures in-place,or implementing the queues, such as heaps, min-max heaps, deaps, and twin-heaps. Over the years the problem of constructing these heap-like structures has received much attention in the literature, but different structures possess different construction algorithms. In this paper, we present a unifor作者: 慢慢流出 時間: 2025-4-1 02:25 作者: 使痛苦 時間: 2025-4-1 06:30
A simple balanced search tree with ,(1) worst-case update time,st-case time (once the position of the inserted or deleted key is known). Our data structure is quite natural and much simpler than previous worst-case optimal solutions. It is based on two techniques: 1) ., i.e. storing an ordered list of 2log . keys in each leaf of an (.) tree, and 2) ., i.e. post作者: Palate 時間: 2025-4-1 12:56 作者: 是貪求 時間: 2025-4-1 17:20
Permutation routing on reconfigurable meshes,troduce both worst case algorithms and algorithms that are better on average. The time bounds presented are better than those achievable on the conventional mesh and previously known algorithms..We present two variants of the reconfigurable mesh. In the first model, M., the processors are attached t作者: 盡忠 時間: 2025-4-1 19:58
Adaptive and oblivious algorithms for d-cube permutation routing, 7 (called 7-cube). We also prove an ./log .) lower bound for the class of deterministic restricted oblivious permutation routing algorithms. Finally, we design optimal deterministic oblivious permutation routing on the .-cube, . ≤ 6.作者: 類型 時間: 2025-4-2 00:58
On quadratic lattice approximations,re given this is the well known lattice approximation problem. We call the general version the quadratic lattice approximation problem. In this paper we construct via derandomization lattice points with small linear and quadratic discrepancies. Unfortunately the known derandomization methods do not 作者: BOLUS 時間: 2025-4-2 03:47
How to treat delete requests in semi-online problems,
