標(biāo)題: Titlebook: Algorithm Theory -- SWAT 2012; 13th Scandinavian Sy Fedor V. Fomin,Petteri Kaski Conference proceedings 2012 Springer-Verlag Berlin Heidelb [打印本頁] 作者: fundoplication 時(shí)間: 2025-3-21 17:01
書目名稱Algorithm Theory -- SWAT 2012影響因子(影響力)
書目名稱Algorithm Theory -- SWAT 2012影響因子(影響力)學(xué)科排名
書目名稱Algorithm Theory -- SWAT 2012網(wǎng)絡(luò)公開度
書目名稱Algorithm Theory -- SWAT 2012網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithm Theory -- SWAT 2012被引頻次
書目名稱Algorithm Theory -- SWAT 2012被引頻次學(xué)科排名
書目名稱Algorithm Theory -- SWAT 2012年度引用
書目名稱Algorithm Theory -- SWAT 2012年度引用學(xué)科排名
書目名稱Algorithm Theory -- SWAT 2012讀者反饋
書目名稱Algorithm Theory -- SWAT 2012讀者反饋學(xué)科排名
作者: 戰(zhàn)役 時(shí)間: 2025-3-21 22:31
978-3-642-31154-3Springer-Verlag Berlin Heidelberg 2012作者: 匯總 時(shí)間: 2025-3-22 00:31 作者: CANDY 時(shí)間: 2025-3-22 06:16
Die Verfassung des vereinten Deutschlandsurfaces . and . asks to compute a surface .???. with minimum Fréchet distance to .. Like the Fréchet distance, the partial Fréchet distance is NP-hard to compute between terrains and also between polygons with holes. We restrict ., ., and . to be coplanar simple polygons. For this restricted class 作者: Bravado 時(shí)間: 2025-3-22 10:31
Die beiden deutschen Staaten und ihre Umweltres, both in the plane, we wish to find a subset of squares that maximizes the number of points contained in exactly one square in the subset. Erlebach and van Leeuwen (2008) introduced this problem as the geometric version of the unique coverage problem, and the best approximation ratio by van Leeu作者: 牽連 時(shí)間: 2025-3-22 13:58
Demokratie und Politik in Deutschland any line is visible (along a line) from at least one point of the route; similarly, we define a watchman route (tour) for a connected set . of line segments. The watchman route problem for a given set of lines or line segments is to find a shortest watchman route for the input set, and these proble作者: faction 時(shí)間: 2025-3-22 20:59 作者: 廚師 時(shí)間: 2025-3-22 21:26 作者: 變量 時(shí)間: 2025-3-23 02:15 作者: FLACK 時(shí)間: 2025-3-23 06:48 作者: Yourself 時(shí)間: 2025-3-23 12:40
https://doi.org/10.1007/978-3-658-36256-0. contains at least one end-point of each edge and such that . induces a connected subgraph. For this problem we present a deterministic algorithm running in .(2.poly(.)) time and polynomial space, improving over the previous-best .(2.4882.poly(.)) time deterministic algorithm and .(2.poly(.)) time 作者: Water-Brash 時(shí)間: 2025-3-23 15:02
https://doi.org/10.1007/978-3-658-36256-0ph and the subgraph induced on the other is an independent set. We study the problem of deleting the minimum number of vertices or edges from a given input graph so that the resulting graph is split.We initiate a systematic study and give efficient fixed-parameter algorithms and polynomial sized ker作者: Plaque 時(shí)間: 2025-3-23 19:03 作者: interlude 時(shí)間: 2025-3-23 23:35 作者: Priapism 時(shí)間: 2025-3-24 03:22
,Die milit?rischen Mittel der Politik,ces (except perhaps their end-vertices). The . problem is to test whether a graph . with . pairs of specified vertices (..,..) contains . mutually induced paths .. such that .. connects .. and .. for .?=?1,…,.. This problem is known to be NP-complete already for .?=?2. We prove that it can be solved作者: 防水 時(shí)間: 2025-3-24 08:57 作者: 協(xié)迫 時(shí)間: 2025-3-24 12:58
Technikberatung in der Demokratiemoving distance of the sensors is minimized. Previously, it was an open question whether this problem on sensors with arbitrary sensing ranges is solvable in polynomial time. We settle this open question positively by giving an .(..log.loglog.) time algorithm. Further, if all sensors have the same-s作者: BLA 時(shí)間: 2025-3-24 14:54 作者: 委托 時(shí)間: 2025-3-24 20:56
https://doi.org/10.1007/978-3-663-09582-8ference at ., denoted .(.), is the number of antennas that cover ., and the interference of a communication graph .?=?(.,.) is .(.)?=? max {.(.) : .?∈?.}. In this paper we address the question in its title. That is, we study several variants of the following problem: What is the minimum interference作者: Myocyte 時(shí)間: 2025-3-24 23:20 作者: 漫不經(jīng)心 時(shí)間: 2025-3-25 05:41
Kasseler Edition Soziale ArbeitWe present an .(.. loglog./log..) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of .(.. (loglog.)./log.. ) time.作者: 協(xié)奏曲 時(shí)間: 2025-3-25 08:10 作者: 截?cái)?nbsp; 時(shí)間: 2025-3-25 13:52
Algorithm Theory -- SWAT 2012978-3-642-31155-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 鐵塔等 時(shí)間: 2025-3-25 17:15
Fedor V. Fomin,Petteri KaskiState-of-the-art research.Fast-track conference proceedings.Unique visibility作者: apropos 時(shí)間: 2025-3-25 23:44
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152836.jpg作者: 違抗 時(shí)間: 2025-3-26 00:13 作者: Excitotoxin 時(shí)間: 2025-3-26 08:23 作者: 骨 時(shí)間: 2025-3-26 11:51
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares,wen (2009) before our work was 2. Our scheme can be generalized to the budgeted unique unit-square coverage problem, in which each point has a profit, each square has a cost, and we wish to maximize the total profit of the uniquely covered points under the condition that the total cost is at most a given bound.作者: intertwine 時(shí)間: 2025-3-26 13:07
On Minimum Sum of Radii and Diameters Clustering,SR problem, we give an exact algorithm when the metric is the shortest-path metric of an unweighted graph and there cannot be any singleton clusters. For the MSD problem on the plane with Euclidean distances, we present a polynomial time approximation scheme.作者: 精密 時(shí)間: 2025-3-26 19:36
Faster Parameterized Algorithms for Deletion to Split Graphs,nels for the problem. More precisely,.In addition, we note that our algorithm for .? adds to the small number of subexponential parameterized algorithms not obtained through bidimensionality, and on general graphs.作者: 實(shí)施生效 時(shí)間: 2025-3-27 00:56 作者: AFFIX 時(shí)間: 2025-3-27 01:15 作者: Firefly 時(shí)間: 2025-3-27 05:54
Demokratie und Politik in Deutschlandre, ..(.)?=?..(.) is the maximum length of Davenport-Schinzel sequences of order . on . symbols. Our . processes nearly cubic events for the . which improves the previous bound .(..) by Rahmati ... [1].作者: 染色體 時(shí)間: 2025-3-27 13:19
,Das ?Rheinmodell‘ des Kapitalismus,ity metric is Θ(.). Furthermore, we develop an .(..(.?+?.)log(.?+?.))-time iterative algorithm to compute the ..-order city Voronoi diagram and an .(.log.(.?+?.)log.)-time divide-and-conquer algorithm to compute the farthest-site city Voronoi diagram.作者: ALIAS 時(shí)間: 2025-3-27 17:03
https://doi.org/10.1007/978-3-658-36256-0ariant with real weights..Finally, we show that in .(2.poly(.)) time and space one can count the number of connected vertex covers of size at most ., and this time upper bound can not be improved to .((2???.).poly(.)) for any .?>?0 under the Strong Exponential Time Hypothesis, as shown by Cygan et al.?[CCC’12].作者: Rinne-Test 時(shí)間: 2025-3-27 18:16
Demokratietheoretische Entwicklungsliniens,o be unlikely that ... can be solved in time ..·.., it was open whether the ... could be solved in single-exponential FPT time, i.e. in ..·.. time. This paper answers this question in the affirmative.作者: 短程旅游 時(shí)間: 2025-3-28 00:23
Kinetic Pie Delaunay Graph and Its Applications,re, ..(.)?=?..(.) is the maximum length of Davenport-Schinzel sequences of order . on . symbols. Our . processes nearly cubic events for the . which improves the previous bound .(..) by Rahmati ... [1].作者: orient 時(shí)間: 2025-3-28 05:17
Higher Order City Voronoi Diagrams,ity metric is Θ(.). Furthermore, we develop an .(..(.?+?.)log(.?+?.))-time iterative algorithm to compute the ..-order city Voronoi diagram and an .(.log.(.?+?.)log.)-time divide-and-conquer algorithm to compute the farthest-site city Voronoi diagram.作者: Coronation 時(shí)間: 2025-3-28 09:17 作者: pacifist 時(shí)間: 2025-3-28 10:32 作者: Hemoptysis 時(shí)間: 2025-3-28 14:43 作者: 多余 時(shí)間: 2025-3-28 20:18
Demokratie und Politik in Deutschlande NP-hardness of this problem for line segments in the plane and provide a polynomial-time approximation algorithm with ratio .(log..). Additionally, we consider some special cases of the watchman route problem on line segments, for which we provide improved approximation or exact algorithms.作者: 背信 時(shí)間: 2025-3-29 00:41 作者: inhibit 時(shí)間: 2025-3-29 03:31 作者: 抵押貸款 時(shí)間: 2025-3-29 08:04
Watchman Routes for Lines and Segments,e NP-hardness of this problem for line segments in the plane and provide a polynomial-time approximation algorithm with ratio .(log..). Additionally, we consider some special cases of the watchman route problem on line segments, for which we provide improved approximation or exact algorithms.作者: 煩憂 時(shí)間: 2025-3-29 13:33 作者: perpetual 時(shí)間: 2025-3-29 18:53
Minimum Convex Partitions and Maximum Empty Polytopes,e largest tile is .(1/.) in any dimension .?≥?2. Here we give a (1???.)-approximation algorithm for computing the maximum volume of an empty convex body amidst . given points in the .-dimensional unit box [0,1]..作者: Indecisive 時(shí)間: 2025-3-29 21:02
Die Verfassung des vereinten Deutschlandof surfaces, we develop a polynomial time algorithm to compute the partial Fréchet distance and show that such an .???. can be computed in polynomial time as well. This is the first algorithm to address a partial Fréchet distance problem for surfaces and extends Buchin?et?al.’s algorithm for computing the Fréchet distance between simple polygons.作者: SLAG 時(shí)間: 2025-3-30 00:03
Die beiden deutschen Staaten und ihre Umweltwen (2009) before our work was 2. Our scheme can be generalized to the budgeted unique unit-square coverage problem, in which each point has a profit, each square has a cost, and we wish to maximize the total profit of the uniquely covered points under the condition that the total cost is at most a given bound.作者: 憎惡 時(shí)間: 2025-3-30 06:24
Wandlungen des bundesdeutschen Sozialstaats,SR problem, we give an exact algorithm when the metric is the shortest-path metric of an unweighted graph and there cannot be any singleton clusters. For the MSD problem on the plane with Euclidean distances, we present a polynomial time approximation scheme.作者: abreast 時(shí)間: 2025-3-30 11:07
https://doi.org/10.1007/978-3-658-36256-0nels for the problem. More precisely,.In addition, we note that our algorithm for .? adds to the small number of subexponential parameterized algorithms not obtained through bidimensionality, and on general graphs.作者: obligation 時(shí)間: 2025-3-30 13:41 作者: 食草 時(shí)間: 2025-3-30 20:37
0302-9743 rnational Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 submissions. The paper作者: Lymphocyte 時(shí)間: 2025-3-30 22:40
Demokratie und Politik in Deutschland is .. In this model of visibility, we study the classical variants of point visibility, weak and complete segment visibility, and the construction of the visibility graph. We also investigate the natural query versions of these problems, when . is either fixed or specified at query time.作者: 稱贊 時(shí)間: 2025-3-31 04:21 作者: obstinate 時(shí)間: 2025-3-31 09:02 作者: 終點(diǎn) 時(shí)間: 2025-3-31 09:57 作者: 疼死我了 時(shí)間: 2025-3-31 14:36
A Simple Framework for the Generalized Nearest Neighbor Problem,ses of query objects and distance functions in a unified way. Moreover, for linear space requirements the method simplifies the known approach based on ray-shooting in the lower envelope of an arrangement.作者: notion 時(shí)間: 2025-3-31 18:17 作者: degradation 時(shí)間: 2025-4-1 01:20
,-Visibility,s said to be .-visible from a point ., if there exists an empty triangle with one vertex at . and the side opposite to . on . such that the angle at . is .. In this model of visibility, we study the classical variants of point visibility, weak and complete segment visibility, and the construction of作者: Bumptious 時(shí)間: 2025-4-1 03:13
