標題: Titlebook: Algorithms - ESA 2008; 16th Annual European Dan Halperin,Kurt Mehlhorn Conference proceedings 2008 The Editor(s) (if applicable) and The Au [打印本頁] 作者: Addendum 時間: 2025-3-21 18:05
書目名稱Algorithms - ESA 2008影響因子(影響力)
書目名稱Algorithms - ESA 2008影響因子(影響力)學科排名
書目名稱Algorithms - ESA 2008網(wǎng)絡公開度
書目名稱Algorithms - ESA 2008網(wǎng)絡公開度學科排名
書目名稱Algorithms - ESA 2008被引頻次
書目名稱Algorithms - ESA 2008被引頻次學科排名
書目名稱Algorithms - ESA 2008年度引用
書目名稱Algorithms - ESA 2008年度引用學科排名
書目名稱Algorithms - ESA 2008讀者反饋
書目名稱Algorithms - ESA 2008讀者反饋學科排名
作者: Hot-Flash 時間: 2025-3-21 23:38 作者: 費解 時間: 2025-3-22 02:25 作者: 開花期女 時間: 2025-3-22 05:35 作者: urethritis 時間: 2025-3-22 12:44
Stabbing Convex Polygons with a Segment or a Polygonflection), is called . if . does not intersect the interior of any polygon in . at this placement. A placement . of . is called . if . forms three “distinct” contacts with . at .. Let . be the number of free critical placements. A set of placements of . is called a . of . if each polygon in . inters作者: ablate 時間: 2025-3-22 12:57 作者: paradigm 時間: 2025-3-22 20:47
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetryd as a measure of the heterogeneity of links in a data communication network. In this paper we provide a near-tight upper bound on the competitive ratio of the Online Steiner Tree problem in graphs of bounded edge asymmetry .. This problem has applications in efficient multicasting over networks wit作者: jaunty 時間: 2025-3-22 22:35 作者: 開始沒有 時間: 2025-3-23 04:24
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains if . denotes the number of triangles in the terrain, we show the following two results..(i) If the triangles of the terrain have bounded slope and the projection of the set of triangles onto the .-plane has low density, then the worst-case complexity of a bisector is?.(.)..(ii) If, in addition, the作者: 鉗子 時間: 2025-3-23 08:22
Space-Time Tradeoffs for Proximity Searching in Doubling Spacesd an error bound .>?0. The objective is to build a data structure so that given any query point . in the space, it is possible to efficiently determine a point of . whose distance from . is within a factor of (1?+?.) of the distance between . and its nearest neighbor in .. In this paper we obtain th作者: 道學氣 時間: 2025-3-23 11:52
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problemroblem are based on linear programming and the ellipsoid method. In this paper we apply a capacity scaling approach and develop a purely combinatorial weakly polynomial algorithm of time complexity .(.(.,.,.) .. log.. log.), where ., ., . are the number of nodes, the number of edges, and the maximum作者: 危機 時間: 2025-3-23 15:47
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphsct dependencies and occur in many areas, e. g., in scheduling problems and program inheritance structures..In this paper we extend level graphs to cyclic level graphs. Such graphs occur as repeating processes in cyclic scheduling, visual data mining, life sciences, and VLSI. We provide a complete st作者: FLUSH 時間: 2025-3-23 19:20 作者: 寬大 時間: 2025-3-24 02:16
Randomized Competitive Analysis for Two-Server Problemshe first nontrivial upper bound for randomized .-server algorithms in a general metric space whose competitive ratio is well below the corresponding deterministic lower bound (= 2 in the 2-server case).作者: 過份好問 時間: 2025-3-24 03:29
Decompositions and Boundary Coverings of Non-convex Fat Polyhedraces of the polyhedron. We also show that the restriction that the faces are fat is necessary: there are locally-fat polyhedra with non-fat faces that require .(..) pieces in any convex decomposition. Furthermore, we show that if we want the polyhedra in the decomposition to be fat themselves, then t作者: Cerebrovascular 時間: 2025-3-24 09:18
An Integer Programming Algorithm for Routing Optimization in IP Networksata packets are sent along shortest paths with respect to these lengths from their source to their destination..In this paper, we present an integer programming algorithm for the minimum congestion unsplittable shortest path routing problem, which arises in the operational planning of such networks.作者: 開始發(fā)作 時間: 2025-3-24 13:08 作者: 繁忙 時間: 2025-3-24 16:11
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning TreeBy ?(.) and ?.(.) we denote the maximum number of leaves over all out-trees and out-branchings of ., respectively. We give fixed parameter tractable algorithms for deciding whether ?.(.)?≥?. and whether ?(.)?≥?. for a digraph . on . vertices, both with time complexity 2. ·... This proves the problem作者: 狂怒 時間: 2025-3-24 19:13
https://doi.org/10.1007/978-3-7091-5046-7lan their paths to desired locations. These paths must avoid collisions with the environment and with other moving characters. Also a chosen path must be natural, meaning that it is the kind of path a real human being could take. The algorithms for planning such paths must be able to handle hundreds作者: nocturnal 時間: 2025-3-25 01:31
Der Elektromotor als Kraftmaschine,ectual effort needed for designing efficient algorithms for such architectures may be most fruitfully pursued as an effort in designing portable algorithms for such a bridging model. Portable algorithms would contain efficient designs for all reasonable ranges of the basic resource parameters and in作者: Genetics 時間: 2025-3-25 06:00
Monographische Literatur zum Elektrounfall,r many problems have been proposed, some difficulties remain in devising and implementing them, especially robustly. One set of difficulties stems from the required update mechanisms used for processing certificate failures—devising efficient update mechanisms can be difficult, especially for sophis作者: 負擔 時間: 2025-3-25 11:31
https://doi.org/10.1007/978-3-642-68227-8e external memory models and a near optimal result in the RAM model; all our results consume linear space. We can answer queries in .(log .?+?.) time on a pointer machine, with .(log..?+?./.) I/Os in the external memory model and in .((log log.).?+?log log .?+?.) time in the RAM model and in a .×.×.作者: VEST 時間: 2025-3-25 15:10
https://doi.org/10.1007/978-3-662-39622-3flection), is called . if . does not intersect the interior of any polygon in . at this placement. A placement . of . is called . if . forms three “distinct” contacts with . at .. Let . be the number of free critical placements. A set of placements of . is called a . of . if each polygon in . inters作者: 收集 時間: 2025-3-25 16:56
,Einiges über Kropf bei Tieren, the (2,.)-center problem where we compute the minimal radius pair of congruent disks to cover .???. points of .. We present a randomized algorithm with .(... log..) expected running time for the (2,.)-center problem. We also study the (.,.)-center problem in ?. under the ?.-metric. We give solution作者: audiologist 時間: 2025-3-25 23:09
Der optische Feldeffekt an Einkristallen,d as a measure of the heterogeneity of links in a data communication network. In this paper we provide a near-tight upper bound on the competitive ratio of the Online Steiner Tree problem in graphs of bounded edge asymmetry .. This problem has applications in efficient multicasting over networks wit作者: Prosaic 時間: 2025-3-26 02:11 作者: 迷住 時間: 2025-3-26 05:12 作者: 合適 時間: 2025-3-26 09:20 作者: CLOWN 時間: 2025-3-26 15:23 作者: 朦朧 時間: 2025-3-26 20:40 作者: 語源學 時間: 2025-3-26 21:23 作者: 眨眼 時間: 2025-3-27 03:20
Constantin Brunner,Lothar Bickelhe first nontrivial upper bound for randomized .-server algorithms in a general metric space whose competitive ratio is well below the corresponding deterministic lower bound (= 2 in the 2-server case).作者: 托人看管 時間: 2025-3-27 06:08
Constantin Brunner,Lothar Bickelces of the polyhedron. We also show that the restriction that the faces are fat is necessary: there are locally-fat polyhedra with non-fat faces that require .(..) pieces in any convex decomposition. Furthermore, we show that if we want the polyhedra in the decomposition to be fat themselves, then t作者: scrutiny 時間: 2025-3-27 10:25
https://doi.org/10.1007/978-3-642-91741-7ata packets are sent along shortest paths with respect to these lengths from their source to their destination..In this paper, we present an integer programming algorithm for the minimum congestion unsplittable shortest path routing problem, which arises in the operational planning of such networks.作者: 得意牛 時間: 2025-3-27 13:44 作者: MINT 時間: 2025-3-27 21:19 作者: Alopecia-Areata 時間: 2025-3-28 00:02 作者: Fortuitous 時間: 2025-3-28 05:19
Approximating Multi-criteria Max-TSPWe present randomized approximation algorithms for multi-criteria Max-TSP. For Max-STSP with .?>?1 objective functions, we obtain an approximation ratio of . for arbitrarily small .>?0. For Max-ATSP with . objective functions, we obtain a ratio of ..作者: Osteoarthritis 時間: 2025-3-28 07:11
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153051.jpg作者: 青春期 時間: 2025-3-28 13:47
https://doi.org/10.1007/978-3-540-87744-8algorithm design; algorithm theory; algorithmic mathematics; algorithmics; algorithms; algorithms analysi作者: Lumbar-Spine 時間: 2025-3-28 18:07
978-3-540-87743-1The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer-Verlag GmbH, DE作者: 一致性 時間: 2025-3-28 20:42 作者: folliculitis 時間: 2025-3-29 02:39 作者: 一加就噴出 時間: 2025-3-29 03:19
Constantin Brunner,Lothar Bickelhe first nontrivial upper bound for randomized .-server algorithms in a general metric space whose competitive ratio is well below the corresponding deterministic lower bound (= 2 in the 2-server case).作者: pacifist 時間: 2025-3-29 07:14 作者: mydriatic 時間: 2025-3-29 12:28 作者: DOSE 時間: 2025-3-29 16:52
Flexible Path Planning Using Corridor Mapse environment and local steering behavior. The result is a method that keeps the advantages of the . but has much more natural steering. Also the method allows for more flexibility in the desired routes of the characters.作者: Manifest 時間: 2025-3-29 20:23
Robust Kinetic Convex Hulls in 3D advances on self-adjusting computation to provide a robust motion simulation technique that combines kinetic event-based scheduling and the classic idea of fixed-time sampling. The idea is to divide time into a lattice of fixed-size intervals, and process events at the resolution of an interval. We作者: 輕浮思想 時間: 2025-3-30 03:13
On Dominance Reporting in 3D models. Using our 3D results as base cases, we can provide improved orthogonal range reporting algorithms in ?., .?≥?4. We use randomization only in the preprocessing part and our query bounds are all worst case.作者: LAVE 時間: 2025-3-30 07:46
https://doi.org/10.1007/978-3-7091-5046-7e environment and local steering behavior. The result is a method that keeps the advantages of the . but has much more natural steering. Also the method allows for more flexibility in the desired routes of the characters.作者: grotto 時間: 2025-3-30 10:34 作者: 一罵死割除 時間: 2025-3-30 12:37 作者: cogent 時間: 2025-3-30 18:30
Conference proceedings 2008nd engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization.作者: CORE 時間: 2025-3-30 21:48
0302-9743 ications and engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization.978-3-540-87743-1978-3-540-87744-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 遺產(chǎn) 時間: 2025-3-31 01:56 作者: fulmination 時間: 2025-3-31 08:16 作者: Bombast 時間: 2025-3-31 12:15
https://doi.org/10.1007/978-3-642-91741-7s based on, present the integer and linear programming models used to solve the master and the client problem, and discuss the most important implementational aspects. Finally, we report computational results for various benchmark problems, which demonstrate the efficiency of our algorithm.作者: 縮短 時間: 2025-3-31 14:37
https://doi.org/10.1007/978-3-642-91741-7ith minimum in-degree 3, ., where previously . was the best known bound. This bound is tight, and also holds for the larger class of digraphs with minimum in-degree 3 in which every arc is part of at least one out-branching.作者: aesthetician 時間: 2025-3-31 20:06
Stabbing Convex Polygons with a Segment or a Polygone segment and the obstacles in . are pairwise-disjoint, (ii) . is a line segment and the obstacles in . may intersect (iii) . is a convex .-gon and the obstacles in . are disjoint, and use these improved bounds to analyze the running time of our stabbing-set algorithm.作者: 睨視 時間: 2025-4-1 01:13 作者: 郊外 時間: 2025-4-1 04:19 作者: IRK 時間: 2025-4-1 08:12
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Treeith minimum in-degree 3, ., where previously . was the best known bound. This bound is tight, and also holds for the larger class of digraphs with minimum in-degree 3 in which every arc is part of at least one out-branching.作者: 含糊 時間: 2025-4-1 11:05 作者: 譏諷 時間: 2025-4-1 14:37
Der Enterprise Transformation Cycleudy of strongly connected cyclic level graphs. In particular, we present a linear time algorithm for the planarity testing and embedding problem, and we characterize forbidden subgraphs. Our results generalize earlier work on level graphs.作者: 的闡明 時間: 2025-4-1 21:24
Constantin Brunner,Lothar Bickelhe worst-case number of tetrahedra cannot be bounded as a function of?.. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire?interior.作者: prediabetes 時間: 2025-4-2 02:25 作者: 門窗的側(cè)柱 時間: 2025-4-2 06:54
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetryh non-symmetric links. We show an improved upper bound of . on the competitive ratio of a simple greedy algorithm, for any request sequence of . terminals. The result almost matches the lower bound of . (where . is an arbitrarily small constant) due to Faloutsos . [8] and Angelopoulos [2].作者: 信任 時間: 2025-4-2 09:37 作者: FAST 時間: 2025-4-2 14:45
Decompositions and Boundary Coverings of Non-convex Fat Polyhedrahe worst-case number of tetrahedra cannot be bounded as a function of?.. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire?interior.作者: 檔案 時間: 2025-4-2 17:18
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. We also provide an improved bound trading off speed for additional machines..Our analysis relies on a new concept for counting the workload of an interval, that might also turn useful for analyzing other types of task systems.
