標題: Titlebook: Algorithms - ESA 2000; 8th Annual European Mike S. Paterson Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Approximati [打印本頁] 作者: Eisenhower 時間: 2025-3-21 18:30
書目名稱Algorithms - ESA 2000影響因子(影響力)
書目名稱Algorithms - ESA 2000影響因子(影響力)學科排名
書目名稱Algorithms - ESA 2000網(wǎng)絡公開度
書目名稱Algorithms - ESA 2000網(wǎng)絡公開度學科排名
書目名稱Algorithms - ESA 2000被引頻次
書目名稱Algorithms - ESA 2000被引頻次學科排名
書目名稱Algorithms - ESA 2000年度引用
書目名稱Algorithms - ESA 2000年度引用學科排名
書目名稱Algorithms - ESA 2000讀者反饋
書目名稱Algorithms - ESA 2000讀者反饋學科排名
作者: 歡笑 時間: 2025-3-21 21:39 作者: AMITY 時間: 2025-3-22 03:33
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphsfor trees, no polynomial time algorithm for p-median problem has been reported for any large class of graphs. We introduce a . of computation and show how to solve the .-center problem on an circular-arc graph in . time, assuming that the arc endpoints are sorted.作者: 表否定 時間: 2025-3-22 05:15
K-D Trees Are Better when Cut on the Longest Sideve been empirically shown to exhibit polylogarithmic performance, and under certain restrictions in the data distribution some theoretical expected case results have been proven. This result, however, is the first one proving a worst-case polylogarithmic time bound for approximate geometric queries using the simple .-d tree data structure.作者: 閃光東本 時間: 2025-3-22 10:43 作者: Spangle 時間: 2025-3-22 12:56
Planspiele als Methode im Politikunterricht,is known to be approximable within a factor of 0.72 of the optimum (Andersson and Engebretsen, 1998). The authors (1999) designed an 0.5-approximation for the special case when the hypergraph is a graph. The main result of this paper is that ...-.. GSP can be approximated within a factor of min. of the optimum, where ..作者: Nonflammable 時間: 2025-3-22 17:53 作者: 閑聊 時間: 2025-3-23 01:10 作者: Anal-Canal 時間: 2025-3-23 03:23
Planspiele als Methode im Politikunterricht,uence σ of requests one has to serve in turn, we are interested in the minimal cost needed to serve all requests. Little is known about this problem. The best algorithm so far needs exponential time in the number of items in the list. We show that there is no poly-nomial algorithm unless ..作者: GULF 時間: 2025-3-23 08:03
,IT-GESTüTZTES SOCIAL NETWORKING,r. By the same method we prove an .(..β(.)) upper bound on the number of triangles congruent to a given one among . points in threedimensional space, improving an .(..)-bound of Akutsu et al. The corresponding lower bound for both problems is Ω(..).作者: tenuous 時間: 2025-3-23 09:42
Entscheidung über den Einspruchoint location queries and range queries with ranges of small width. For certain important special cases, our bounds are optimal. We also show how to update the structure dynamically, and we generalize our results to higher-dimensional spaces.作者: 痛苦一生 時間: 2025-3-23 16:10 作者: WAIL 時間: 2025-3-23 22:01
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointsetr. By the same method we prove an .(..β(.)) upper bound on the number of triangles congruent to a given one among . points in threedimensional space, improving an .(..)-bound of Akutsu et al. The corresponding lower bound for both problems is Ω(..).作者: DOTE 時間: 2025-3-24 00:10
On R-Trees with Low Stabbing Numberoint location queries and range queries with ranges of small width. For certain important special cases, our bounds are optimal. We also show how to update the structure dynamically, and we generalize our results to higher-dimensional spaces.作者: 安撫 時間: 2025-3-24 05:48 作者: 開始發(fā)作 時間: 2025-3-24 08:21
https://doi.org/10.1007/978-3-658-01278-6” objective function is minimized, (iii) there are optimal decomposition algorithms that significantly expedite the Minkowski-sum computation, but the decomposition itself is expensive to compute — in such cases simple heuristics that approximate the optimal decomposition perform very well.作者: MUTE 時間: 2025-3-24 10:57 作者: 反對 時間: 2025-3-24 16:48
Conlusio und Handlungsempfehlungen,h . vertices and . edges, then we may find a directed minimum.The key of our construction is a so-called . step that, given an arbitrary set system with odd intersection, finds an odd set with value not more than the maximum of the initial system.作者: 鋼盔 時間: 2025-3-24 21:33 作者: chassis 時間: 2025-3-25 00:24
Aussetzung und Ruhen des Verfahrensltiplicative factor away from the corresponding lower bounds that we determine for the class, where . is the maximum edge weight. We then show how to extend our results to other multicriteria online problems sharing similar properties.作者: FOVEA 時間: 2025-3-25 03:54 作者: CRASS 時間: 2025-3-25 10:54 作者: FORGO 時間: 2025-3-25 12:46
On Recognizing Cayley Graphshism between two Cayley graphs on ?., i.e., between two circulant graphs. This latter algorithm is extended to an optimal O(.)-time algorithm that tests colorisomorphism between two Abelian Cayley graphs of bounded degree.作者: predict 時間: 2025-3-25 16:00
Fast Algorithms for Even/Odd Minimum Cuts and Generalizationsh . vertices and . edges, then we may find a directed minimum.The key of our construction is a so-called . step that, given an arbitrary set system with odd intersection, finds an odd set with value not more than the maximum of the initial system.作者: exclamation 時間: 2025-3-25 22:04 作者: 協(xié)定 時間: 2025-3-26 01:11 作者: Fraudulent 時間: 2025-3-26 05:25
Conference proceedings 2000 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, exte作者: neutrophils 時間: 2025-3-26 10:46
An Approximation Algorithm for Hypergraph Max ,-Cut with Given Sizes of Partsis known to be approximable within a factor of 0.72 of the optimum (Andersson and Engebretsen, 1998). The authors (1999) designed an 0.5-approximation for the special case when the hypergraph is a graph. The main result of this paper is that ...-.. GSP can be approximated within a factor of min. of the optimum, where ..作者: MUT 時間: 2025-3-26 15:45 作者: Benign 時間: 2025-3-26 16:54
0302-9743 etry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms.978-3-540-41004-1978-3-540-45253-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 書法 時間: 2025-3-27 00:41 作者: 親愛 時間: 2025-3-27 02:46
Was tun, wenn alles zu sp?t ist?We introduce the ., which abstracts a data structure common to applications in graph visualization, string matching, and software analysis. We design solutions with a variety of tradeoffs, yielding improvements and new results for these applications.作者: 陳舊 時間: 2025-3-27 08:43
Bekanntgabe eines VerwaltungsaktesWe present a new online algorithm, ., for non-preemptive scheduling of jobs with known processing times on . identical machines which beats the best previous algorithm for . ≥ 64. For . → ∞ its competitive ratio approaches 1 + . > 1.9201.作者: 慢跑鞋 時間: 2025-3-27 10:20
Web Information Retrieval - an Algorithmic PerspectiveIn this paper we survey algorithmic aspects of Web information retrieval. As an example, we discuss ranking of search engine results using connectivity analysis.作者: outskirts 時間: 2025-3-27 15:28
Range Searching over Tree Cross ProductsWe introduce the ., which abstracts a data structure common to applications in graph visualization, string matching, and software analysis. We design solutions with a variety of tradeoffs, yielding improvements and new results for these applications.作者: Bravado 時間: 2025-3-27 20:54 作者: OVERT 時間: 2025-3-28 00:21
Property Testing in Computational Geometry object has a predetermined property . or is “far” from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.作者: 欺騙手段 時間: 2025-3-28 04:00 作者: dry-eye 時間: 2025-3-28 09:50
978-3-540-41004-1Springer-Verlag Berlin Heidelberg 2000作者: 衣服 時間: 2025-3-28 11:33
Schriften zum europ?ischen Managementolecular biology and biochemistry have a.orded entirely novel ways of inspecting the molecular basis of life’s processes. Experimental breakthroughs have occurred in quick succession, with the first completely sequenced bacterial genome being published in 1995 (genome length 1.83 Mio bp, 1700 genes)作者: 尖牙 時間: 2025-3-28 16:19 作者: 遵循的規(guī)范 時間: 2025-3-28 22:18 作者: 多樣 時間: 2025-3-29 01:54 作者: FER 時間: 2025-3-29 05:43
https://doi.org/10.1007/978-3-642-48110-9ive study. Although polynomial time solutions are known for the planar case and for restricted sets of transformations and metrics (like translations and the Hausdorff-metric under L.-norm), no complexity results are formally known for the general problem. In this paper we give polynomial time algor作者: 保存 時間: 2025-3-29 10:42
https://doi.org/10.1007/978-3-642-48110-9e a novel performance metric based on the maximum number of simultaneous cache misses, and present near-optimal on-line algorithms for determining which parts of the streams should be cached at any point in time for the case of a single server and single cache. We extend this model to case of a sing作者: dysphagia 時間: 2025-3-29 14:32 作者: 摘要 時間: 2025-3-29 18:04 作者: Nebulizer 時間: 2025-3-29 20:19
FALLSTUDIEN: EINSATZ VON SNS IN UNTERNEHMEN,median problem is to locate . facilities on a network so as to minimize the average distance from one of the . demand points to one of the . facilities. We provide, given the interval model of an . vertex interval graph, an . time algorithm for the 1-median problem on the interval graph. We also sho作者: NOMAD 時間: 2025-3-30 02:57
,IT-GESTüTZTES SOCIAL NETWORKING, to a given .-point set .. We obtain a randomized .(.. log .β(.))-algorithm for this problem, improving on previous .(..) and .(..)-algorithms of Boxer. By the same method we prove an .(..β(.)) upper bound on the number of triangles congruent to a given one among . points in threedimensional space, 作者: chuckle 時間: 2025-3-30 04:59
Entscheidung über den Einspruch size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge domination is as hard to approximate as the well stud作者: 豐滿有漂亮 時間: 2025-3-30 09:42
https://doi.org/10.1007/978-3-8349-3794-0sumption provided that any pair of stations can communicate in at most . hops. Previous positive results for this problem were known only when . = |.| - 1 (i.e. the unbounded case) or when the stations are equally spaced (i.e. the uniform chain). In particular, Kirousis, Kranakis, Krizanc and Pelc (作者: 小步走路 時間: 2025-3-30 14:15
Bekanntgabe eines Verwaltungsaktes object has a predetermined property . or is “far” from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.作者: CLAN 時間: 2025-3-30 18:31
Entscheidung über den Einspruchof its query time exists. We describe a new algorithm to construct an R-tree for a set of planar objects that has provably good query complexity for point location queries and range queries with ranges of small width. For certain important special cases, our bounds are optimal. We also show how to u作者: 失望未來 時間: 2025-3-30 20:59 作者: Digest 時間: 2025-3-31 02:25 作者: Silent-Ischemia 時間: 2025-3-31 08:19 作者: travail 時間: 2025-3-31 10:36 作者: BOAST 時間: 2025-3-31 15:04
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153049.jpg作者: bonnet 時間: 2025-3-31 18:44
Computational Biology — Algorithms and Moreolecular biology and biochemistry have a.orded entirely novel ways of inspecting the molecular basis of life’s processes. Experimental breakthroughs have occurred in quick succession, with the first completely sequenced bacterial genome being published in 1995 (genome length 1.83 Mio bp, 1700 genes)作者: 不可比擬 時間: 2025-3-31 21:50
Polygon Decomposition for Efficient Construction of Minkowski Sumsdifferent methods for decomposing polygons by their suitability for efficient construction of Minkowski sums. We study and experiment with various well-known decompositions as well as with several new decomposition schemes. We report on our experiments with the various decompositions and different i作者: Legend 時間: 2025-4-1 04:22
An Approximation Algorithm for Hypergraph Max ,-Cut with Given Sizes of Partsd . positive integers ..,..., .. such that .. It is required to partition the vertex set . into . parts ..,..., X., with each part .. having size .., so as to maximize the total weight of edges not lying entirely in any part of the partition. The version of the problem in which |.. may be arbitrary 作者: stratum-corneum 時間: 2025-4-1 07:54 作者: deceive 時間: 2025-4-1 11:03
Computing Largest Common Point Sets under Approximate Congruenceive study. Although polynomial time solutions are known for the planar case and for restricted sets of transformations and metrics (like translations and the Hausdorff-metric under L.-norm), no complexity results are formally known for the general problem. In this paper we give polynomial time algor作者: 小步舞 時間: 2025-4-1 17:56 作者: Commodious 時間: 2025-4-1 20:33 作者: ASTER 時間: 2025-4-1 23:44
Fast Algorithms for Even/Odd Minimum Cuts and Generalizationsoemans and Ramakrishnan by a factor of . (here . is the size of the ground vertex set). Our improvements apply among others to the minimum directed T-odd or T-even cut and to the directed minimum Steiner cut problems. The (slightly more general) result of Goemans and Ramakrishnan shows that a collec
