標(biāo)題: Titlebook: Algorithms and Data Structures; 15th International S Faith Ellen,Antonina Kolokolova,J?rg-Rüdiger Sack Conference proceedings 2017 Springer [打印本頁] 作者: SPIR 時(shí)間: 2025-3-21 19:59
書目名稱Algorithms and Data Structures影響因子(影響力)
書目名稱Algorithms and Data Structures影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度
書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Data Structures被引頻次
書目名稱Algorithms and Data Structures被引頻次學(xué)科排名
書目名稱Algorithms and Data Structures年度引用
書目名稱Algorithms and Data Structures年度引用學(xué)科排名
書目名稱Algorithms and Data Structures讀者反饋
書目名稱Algorithms and Data Structures讀者反饋學(xué)科排名
作者: craven 時(shí)間: 2025-3-21 22:59 作者: 胰臟 時(shí)間: 2025-3-22 04:24 作者: 壟斷 時(shí)間: 2025-3-22 06:43
,Der prim?re Leberkrebs beim Tier,ic graph with bipartition (.,?.). In this paper we consider the maximum bichromatic plane spanning tree problem, which is the problem of computing a bichromatic plane spanning tree of maximum total edge length.作者: 一再遛 時(shí)間: 2025-3-22 11:48
Improved Algorithms for Computing ,-Sink on Dynamic Flow Path Networks, .(.)?[.], in the general and uniform edge capacity cases, respectively. The above results are achieved by organizing relevant data for subpaths in a strategic way during preprocessing, and the final results are obtained by extracting/merging them in an efficient manner.作者: angina-pectoris 時(shí)間: 2025-3-22 15:33
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings,ursively splitting the graph into graphs called umbrellas). We argue that the height of any poly-line drawing must be at least the umbrella depth, and then devise an algorithm that achieves height at most twice the umbrella depth.作者: Amendment 時(shí)間: 2025-3-22 17:16 作者: Brittle 時(shí)間: 2025-3-22 21:30 作者: institute 時(shí)間: 2025-3-23 03:05
Der Praktiker in der Werkstatt,ount of request a replica can serve. The problem falls under the general framework of capacitated set cover. It admits an .-approximation and it is NP-hard to approximate within a factor of .. We study the problem in terms of the treewidth . of the graph and present an .(.)-approximation algorithm.作者: Affluence 時(shí)間: 2025-3-23 06:52
https://doi.org/10.1007/978-3-642-50711-3orial properties of the Strassen computational directed acyclic graph (CDAG). Applications to parallel computation are also developed. The result generalizes a similar bound previously obtained under the constraint of no-recomputation, that is, that intermediate results cannot be computed more than once.作者: DNR215 時(shí)間: 2025-3-23 12:28
Replica Placement on Bounded Treewidth Graphs,ount of request a replica can serve. The problem falls under the general framework of capacitated set cover. It admits an .-approximation and it is NP-hard to approximate within a factor of .. We study the problem in terms of the treewidth . of the graph and present an .(.)-approximation algorithm.作者: Yourself 時(shí)間: 2025-3-23 14:50
,The I/O Complexity of Strassen’s Matrix Multiplication with Recomputation,orial properties of the Strassen computational directed acyclic graph (CDAG). Applications to parallel computation are also developed. The result generalizes a similar bound previously obtained under the constraint of no-recomputation, that is, that intermediate results cannot be computed more than once.作者: 新字 時(shí)間: 2025-3-23 21:14 作者: Cougar 時(shí)間: 2025-3-24 01:57 作者: crutch 時(shí)間: 2025-3-24 05:11 作者: Blemish 時(shí)間: 2025-3-24 07:02 作者: Carcinoma 時(shí)間: 2025-3-24 13:38 作者: 阻擋 時(shí)間: 2025-3-24 16:51 作者: 反應(yīng) 時(shí)間: 2025-3-24 20:36 作者: Sputum 時(shí)間: 2025-3-25 02:43 作者: Pepsin 時(shí)間: 2025-3-25 05:15
,Der prim?re Leberkrebs beim Tier, constant competitive ratio, but for Vertex Cover the Late Accept model is sufficient and for Minimum Spanning Forest the Late Reject model is sufficient. The Matching problem has a competitive ratio of 2, but in the Late Accept/Reject model, its competitive ratio is?..作者: CUMB 時(shí)間: 2025-3-25 07:42
Covering Segments with Unit Squares,or solving some other problems. We also show that our problems have connections with the problems studied by Arkin et al.?[.] on conflict-free covering problem. Our .-completeness results hold for more simplified types of objects than those of Arkin et al.?[.].作者: 都相信我的話 時(shí)間: 2025-3-25 13:20 作者: Lipoprotein 時(shí)間: 2025-3-25 17:14 作者: 虛構(gòu)的東西 時(shí)間: 2025-3-25 23:11
Relaxing the Irrevocability Requirement for Online Graph Algorithms, constant competitive ratio, but for Vertex Cover the Late Accept model is sufficient and for Minimum Spanning Forest the Late Reject model is sufficient. The Matching problem has a competitive ratio of 2, but in the Late Accept/Reject model, its competitive ratio is?..作者: canonical 時(shí)間: 2025-3-26 02:57 作者: crescendo 時(shí)間: 2025-3-26 05:45 作者: declamation 時(shí)間: 2025-3-26 08:28 作者: pulmonary-edema 時(shí)間: 2025-3-26 13:35
https://doi.org/10.1007/978-3-319-62127-2approximation algorithms analysis; data structures design and analysis; design and analysis of algorit作者: BROOK 時(shí)間: 2025-3-26 19:16 作者: 會(huì)議 時(shí)間: 2025-3-27 00:47
Algorithms and Data Structures978-3-319-62127-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Living-Will 時(shí)間: 2025-3-27 03:44
https://doi.org/10.1007/978-3-642-52596-4at the curves of such a representation can be partitioned into . groups that represent outer-string graphs or . groups that represent permutation graphs. This leads to better approximation algorithms for hereditary graph problems, such as independent set, clique and clique cover, on .-VPG graphs.作者: 才能 時(shí)間: 2025-3-27 08:29 作者: THROB 時(shí)間: 2025-3-27 11:57 作者: B-cell 時(shí)間: 2025-3-27 15:04
Der Praktiker in der Werkstatt,dge connectivity, which is called . .-. and (ii) augmenting a given network to a desired value of edge connectivity at a minimum cost which is called . .-.. Many well known problems such as ., ., . 2. and . reduce to these problems in polynomial time. It is easy to see that a minimum solution to the作者: Outspoken 時(shí)間: 2025-3-27 20:28 作者: 專橫 時(shí)間: 2025-3-28 01:28 作者: 運(yùn)動(dòng)性 時(shí)間: 2025-3-28 05:40
Ausbildungs- und Unterrichtsmethoden, some geometric objects in .. These coverage problems form special instances of the . problem which is notoriously hard in several paradigms including approximation and parameterized complexity. Motivated by what are called . in geometry, we consider a variation of the . problem where there are conf作者: tariff 時(shí)間: 2025-3-28 06:14 作者: GRAIN 時(shí)間: 2025-3-28 12:57
,Organisation und F?rderung des Lernens,s the most desirable properties of geometric spanners both in theory and in practice. More specifically, it has the same theoretical and practical properties as the Path-Greedy spanner: a natural definition, small degree, linear number of edges, low weight, and strong .-spanner for every .. The .-Gr作者: 冷漠 時(shí)間: 2025-3-28 18:12 作者: obviate 時(shí)間: 2025-3-28 18:54 作者: 廢止 時(shí)間: 2025-3-28 23:39 作者: AMEND 時(shí)間: 2025-3-29 04:34 作者: 圓木可阻礙 時(shí)間: 2025-3-29 11:04 作者: 船員 時(shí)間: 2025-3-29 14:19
https://doi.org/10.1007/978-3-642-52596-4at the curves of such a representation can be partitioned into . groups that represent outer-string graphs or . groups that represent permutation graphs. This leads to better approximation algorithms for hereditary graph problems, such as independent set, clique and clique cover, on .-VPG graphs.作者: 罵人有污點(diǎn) 時(shí)間: 2025-3-29 17:35 作者: Eructation 時(shí)間: 2025-3-29 22:01 作者: irreparable 時(shí)間: 2025-3-30 03:32
,Der prim?re Leberkrebs beim Tier,ee in a geometric graph is a spanning tree that is non-crossing. Let . and . be two disjoint sets of points in the plane where the points of . are colored red and the points of . are colored blue, and let .. A bichromatic plane spanning tree is a plane spanning tree in the complete bipartite geometr作者: 機(jī)警 時(shí)間: 2025-3-30 06:00 作者: 護(hù)航艦 時(shí)間: 2025-3-30 10:02 作者: Herd-Immunity 時(shí)間: 2025-3-30 16:18 作者: Contracture 時(shí)間: 2025-3-30 16:33 作者: Ruptured-Disk 時(shí)間: 2025-3-31 00:35
Grundbegriffe der Erwachsenenbildung, We note that in the first problem, the polygons are not allowed to contain holes. In fact, there is a family of polygons with holes for which the performance of our local search algorithm is arbitrarily bad.作者: Notorious 時(shí)間: 2025-3-31 02:19
Ausbildungs- und Unterrichtsmethoden,that as long as the conflict graph has bounded arboricity (that includes all the families of intersection graphs of low density objects in low dimensional Euclidean space), there is a parameterized reduction to the problem without conflicts on the covering objects. This is achieved through a randomi作者: 野蠻 時(shí)間: 2025-3-31 08:35
Der Praxisanleiter im Rettungsdienstgle leaves only . paths. A path in a disk intersection graph is isolated if for every pair .,?. of disks that are adjacent along the path, the convex hull of?. is intersected only by disks adjacent to?. or?.. Our reduction can also guarantee the triangle separation property?(1). This leaves only a s作者: 無所不知 時(shí)間: 2025-3-31 11:18 作者: Prophylaxis 時(shí)間: 2025-3-31 17:09
https://doi.org/10.1007/978-3-658-43433-5ithms for milling the surface of a grid polyhedron, which simultaneously give a 2-approximation in tour length and an 8?/?3-approximation in the number of turns. Both length and turns consume area when folding a strip, so we build on past approximation algorithms for these two objectives from 2D mil作者: monogamy 時(shí)間: 2025-3-31 18:23 作者: 難管 時(shí)間: 2025-3-31 22:40 作者: 反抗者 時(shí)間: 2025-4-1 04:16
Effectiveness of Local Search for Art Gallery Problems, We note that in the first problem, the polygons are not allowed to contain holes. In fact, there is a family of polygons with holes for which the performance of our local search algorithm is arbitrarily bad.作者: Postmenopause 時(shí)間: 2025-4-1 09:14
Parameterized Complexity of Geometric Covering Problems Having Conflicts,that as long as the conflict graph has bounded arboricity (that includes all the families of intersection graphs of low density objects in low dimensional Euclidean space), there is a parameterized reduction to the problem without conflicts on the covering objects. This is achieved through a randomi作者: 易受騙 時(shí)間: 2025-4-1 10:29
Obedient Plane Drawings for Disk Intersection Graphs,gle leaves only . paths. A path in a disk intersection graph is isolated if for every pair .,?. of disks that are adjacent along the path, the convex hull of?. is intersected only by disks adjacent to?. or?.. Our reduction can also guarantee the triangle separation property?(1). This leaves only a s作者: 一瞥 時(shí)間: 2025-4-1 17:45 作者: Capture 時(shí)間: 2025-4-1 22:27 作者: 睨視 時(shí)間: 2025-4-2 00:36 作者: 群居男女 時(shí)間: 2025-4-2 04:54
