標題: Titlebook: Algorithms and Data Structures; 18th International S Pat Morin,Subhash Suri Conference proceedings 2023 The Editor(s) (if applicable) and T [打印本頁] 作者: 吞食 時間: 2025-3-21 18:58
書目名稱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é)科排名
作者: Dappled 時間: 2025-3-21 21:52
https://doi.org/10.1007/978-3-663-04576-2enotes the number of vertices of .. These do not require a geometric representation of a disk graph. If a geometric representation of a disk graph is given as input, we can solve these problems more efficiently. In this way, we improve the algorithms for those three problem by Lokshtanov et al. [SODA 2022].作者: 冷漠 時間: 2025-3-22 04:19 作者: 使痛苦 時間: 2025-3-22 05:58
,Personalaspekte in Qualit?tsans?tzen,gorithm runs in . time. This is the first polynomial-time algorithm for the .-center problem for points in convex position. For any fixed integer ., the running time is .. Our algorithm works with little modification for the .-center problem of points in convex position under the Minkowski distance of order . for any fixed positive integer ..作者: Unsaturated-Fat 時間: 2025-3-22 09:33
Der Mitarbeiter im Total Quality Managemente, and much faster and smaller than a conventional search tree. We give the first polynomial-time algorithm for the problem. The algorithm extends naturally to the setting where each query has multiple allowed classes.作者: 責(zé)怪 時間: 2025-3-22 15:12
,Faster Algorithms for?Cycle Hitting Problems on?Disk Graphs,enotes the number of vertices of .. These do not require a geometric representation of a disk graph. If a geometric representation of a disk graph is given as input, we can solve these problems more efficiently. In this way, we improve the algorithms for those three problem by Lokshtanov et al. [SODA 2022].作者: 膽小懦夫 時間: 2025-3-22 20:41 作者: BRINK 時間: 2025-3-23 00:24
,Efficient ,-Center Algorithms for?Planar Points in?Convex Position,gorithm runs in . time. This is the first polynomial-time algorithm for the .-center problem for points in convex position. For any fixed integer ., the running time is .. Our algorithm works with little modification for the .-center problem of points in convex position under the Minkowski distance of order . for any fixed positive integer ..作者: 賞心悅目 時間: 2025-3-23 03:33
,Classification via?Two-Way Comparisons ,e, and much faster and smaller than a conventional search tree. We give the first polynomial-time algorithm for the problem. The algorithm extends naturally to the setting where each query has multiple allowed classes.作者: 統(tǒng)治人類 時間: 2025-3-23 09:29
Datensteuerung und Schnittstellen,rithm, we believe we present the first random order analysis of a non-trivial online algorithm with predictions, by which we obtain an algorithmic separation. This may be useful for distinguishing between algorithms for other problems when Follow-the-Predictions is optimal according to competitive analysis.作者: 捐助 時間: 2025-3-23 10:22
Online Minimum Spanning Trees with Weight Predictions,rithm, we believe we present the first random order analysis of a non-trivial online algorithm with predictions, by which we obtain an algorithmic separation. This may be useful for distinguishing between algorithms for other problems when Follow-the-Predictions is optimal according to competitive analysis.作者: 過分 時間: 2025-3-23 16:40 作者: forthy 時間: 2025-3-23 20:24
,Messekommunikation — ?Touch and Go“,del, where each robot is equipped with an externally visible light that can assume colors from a fixed set of colors, using 9 colors and .(.) rounds. In this work, we present an algorithm that requires only 2 colors and .(.) rounds. The number of colors is optimal since at least two colors are required for point robots?[.].作者: ascetic 時間: 2025-3-23 23:45
https://doi.org/10.1007/978-3-663-04576-2ng an improved and tight analysis. More precisely, we show that it has competitive ratio 2.457 on general metric spaces and 2.366 on the half-line. This is the first upper bound that beats known lower bounds of 2.5 for schedule-based algorithms as well as the natural . algorithm.作者: 無法解釋 時間: 2025-3-24 03:12
https://doi.org/10.1007/978-3-642-91701-1disc containing at least . points whose radius is at most twice that of a SKEG disc. Our algorithm runs in . expected time using . expected space if .; if ., the algorithm computes a 2-approximation solution with high probability in . worst-case time with . space.作者: 抑制 時間: 2025-3-24 07:47
https://doi.org/10.1007/978-3-322-88734-4ach other and of equal length. We present an exact polynomial-time algorithm to compute LSFS between curves under?. and?.. For geometric graphs, we show that the decision problem is NP-hard even if one of the graphs consists of one edge.作者: 使絕緣 時間: 2025-3-24 11:06 作者: elastic 時間: 2025-3-24 18:07
,Online TSP with?Known Locations, lower bound for both the open and the closed variant. Then, we focus on some interesting metric spaces (ring, star, semi-line), providing both lower bounds and polynomial time online algorithms for the problem.作者: 完成 時間: 2025-3-24 19:08
,The Mutual Visibility Problem for?Fat Robots,del, where each robot is equipped with an externally visible light that can assume colors from a fixed set of colors, using 9 colors and .(.) rounds. In this work, we present an algorithm that requires only 2 colors and .(.) rounds. The number of colors is optimal since at least two colors are required for point robots?[.].作者: defuse 時間: 2025-3-25 02:05
,Tight Analysis of?the?Lazy Algorithm for?Open Online Dial-a-Ride,ng an improved and tight analysis. More precisely, we show that it has competitive ratio 2.457 on general metric spaces and 2.366 on the half-line. This is the first upper bound that beats known lower bounds of 2.5 for schedule-based algorithms as well as the natural . algorithm.作者: 宇宙你 時間: 2025-3-25 05:20 作者: interpose 時間: 2025-3-25 11:29
,On Length-Sensitive Fréchet Similarity,ach other and of equal length. We present an exact polynomial-time algorithm to compute LSFS between curves under?. and?.. For geometric graphs, we show that the decision problem is NP-hard even if one of the graphs consists of one edge.作者: 豐滿有漂亮 時間: 2025-3-25 13:28 作者: 特征 時間: 2025-3-25 15:58
978-3-031-38905-4The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: bonnet 時間: 2025-3-25 23:22 作者: 無意 時間: 2025-3-26 03:05
,Messekommunikation — ?Touch and Go“,reposition themselves to reach a configuration where they all see each other. This problem arises under obstructed visibility, where a robot cannot see another robot if there is a third robot on the straight line segment between them. This problem was solved by Sharma .?[.] in the luminous robots mo作者: Jacket 時間: 2025-3-26 05:17 作者: 失敗主義者 時間: 2025-3-26 12:05 作者: Hemoptysis 時間: 2025-3-26 15:45 作者: RALES 時間: 2025-3-26 19:37 作者: Self-Help-Group 時間: 2025-3-26 21:22
Auslesen aus dem System-ROM mit dem 68000,ger ., and the goal is to cover the maximum number of edges possible by picking exactly . vertices. In this paper, we study a natural extension of Partial Vertex Cover to multiple color classes of the edges. In our problem, we are additionally given a partition of . into . color classes . and covera作者: 統(tǒng)治人類 時間: 2025-3-27 01:59
Fehlersuche bei statischen RAMs,or the vertices with at most . colors with specific constraints. In ., we require for each ., a color . such that . dominates all vertices colored .. In ., we require for each color ., a . which dominates all vertices colored .. These problems, defined due to their applications in social and genetic作者: 影響 時間: 2025-3-27 06:05
Mikroprozessorsysteme mit dem 6809,e of elements. The vertex cover problem is an important special case where the subsets and elements are respectively vertices and edges of a given undirected graph. On the other hand, the . versions of both problems offer a different perspective - the objective is to find a linear ordering of the co作者: languor 時間: 2025-3-27 12:00 作者: 公理 時間: 2025-3-27 13:39 作者: 受傷 時間: 2025-3-27 20:20
,Mineralbestand der festen K?rpergewebe,n two distinct vertices . and . of ., can answer queries reporting the cost of the edge (.,?.) in constant time. We want to augment . with . shortcuts in order to minimize the diameter of the resulting graph..For ., . time algorithms are known both for paths [Wang, CG 2018] and trees [Bilò, TCS 2022作者: MARS 時間: 2025-3-28 01:49
https://doi.org/10.1007/978-3-642-91701-1 . vertices, . of which are reflex vertices. We refer to such a disc as a SKEG disc. We present an algorithm to compute a SKEG disc using higher-order geodesic Voronoi diagrams with worst-case time . ignoring polylogarithmic factors..We then present a 2-approximation algorithm that finds a geodesic 作者: 延期 時間: 2025-3-28 04:08
https://doi.org/10.1007/978-3-322-88734-4In the more general disjoint path allocation problem, the input is a sequence of requests, each involving a pair of vertices of a known graph, and the goal is to accept a maximum number of requests forming edge-disjoint paths between accepted pairs. These problems have been studied under extreme set作者: gene-therapy 時間: 2025-3-28 07:45
https://doi.org/10.1007/978-3-322-88734-4ess of their combinatorial features, and only based on proximity, is often required in biomedical and geospatial applications. In this work, we define the length-sensitive partial Fréchet similarity (LSFS) between curves (or graphs), which maximizes the length of matched portions that are close to e作者: 鋪子 時間: 2025-3-28 10:50 作者: 大量殺死 時間: 2025-3-28 16:55
Philologische Studien und Quellenng set and maximum matching – on sparse graph classes, i.e., graphs which satisfy . where .,?. is the number of edges, vertices respectively. Each graph parameter we consider can have size . even on sparse graph classes, and hence for sublinear-space algorithms we are restricted to parameter estimat作者: Infelicity 時間: 2025-3-28 19:23
,Personalaspekte in Qualit?tsans?tzen, position in the plane, our algorithm computes . congruent disks of minimum radius such that each input point is contained in one of the disks. Our algorithm runs in . time. This is the first polynomial-time algorithm for the .-center problem for points in convex position. For any fixed integer ., t作者: CRANK 時間: 2025-3-28 23:16
Der Mitarbeiter im Total Quality Managementy query ., uses equality tests and less-than comparisons to determine the class to which . belongs. Such a tree can be much smaller than a lookup table, and much faster and smaller than a conventional search tree. We give the first polynomial-time algorithm for the problem. The algorithm extends nat作者: 減少 時間: 2025-3-29 05:18 作者: Hiatal-Hernia 時間: 2025-3-29 10:51 作者: 能得到 時間: 2025-3-29 13:53
Algorithms and Data Structures978-3-031-38906-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 委屈 時間: 2025-3-29 17:23
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153143.jpg作者: creditor 時間: 2025-3-29 23:44
,Geometric Spanning Trees Minimizing the?Wiener Index,ex, originally used in chemical graph representations of the non-hydrogen atoms of a molecule, is considered to be a fundamental and useful network descriptor. We study the problem of constructing geometric networks on point sets in Euclidean space that minimize the Wiener index: given a set . of . 作者: carotid-bruit 時間: 2025-3-30 00:09
,The Mutual Visibility Problem for?Fat Robots,reposition themselves to reach a configuration where they all see each other. This problem arises under obstructed visibility, where a robot cannot see another robot if there is a third robot on the straight line segment between them. This problem was solved by Sharma .?[.] in the luminous robots mo作者: 裹住 時間: 2025-3-30 07:46
,Faster Algorithms for?Cycle Hitting Problems on?Disk Graphs, a set of vertices hitting all triangles, all cycles, or all odd cycles, respectively. Our algorithms run in time ., ., and ., respectively, where . denotes the number of vertices of .. These do not require a geometric representation of a disk graph. If a geometric representation of a disk graph is 作者: flutter 時間: 2025-3-30 09:52
,Tight Analysis of?the?Lazy Algorithm for?Open Online Dial-a-Ride,nimizing the completion time. We improve on the best known upper bounds on the competitive ratio on general metric spaces and on the half-line, for both the preemptive and non-preemptive version of the problem. We achieve this by revisiting the algorithm . recently suggested in [WAOA, 2022] and givi作者: 酷熱 時間: 2025-3-30 13:02
,Online TSP with?Known Locations,rival times. We study both the open variant, in which the algorithm is not required to return to the origin when all the requests are served, as well as the closed variant, in which the algorithm has to return to the origin after serving all the requests. Our aim is to measure the impact of the extr作者: inclusive 時間: 2025-3-30 17:53
,Socially Fair Matching: Exact and?Approximation Algorithms,practical motivations. However, in many applications of optimization problems, a “solution” corresponds to real-life decisions that have major impact on humans belonging to diverse groups defined by attributes such as gender, race, or ethnicity. Due to this motivation, the notion of . has recently e作者: 撫育 時間: 2025-3-30 23:07
,A Parameterized Approximation Scheme for?Generalized Partial Vertex Cover,ger ., and the goal is to cover the maximum number of edges possible by picking exactly . vertices. In this paper, we study a natural extension of Partial Vertex Cover to multiple color classes of the edges. In our problem, we are additionally given a partition of . into . color classes . and covera作者: Juvenile 時間: 2025-3-31 03:26 作者: anaphylaxis 時間: 2025-3-31 05:25
,Tight Approximation Algorithms for?Ordered Covering,e of elements. The vertex cover problem is an important special case where the subsets and elements are respectively vertices and edges of a given undirected graph. On the other hand, the . versions of both problems offer a different perspective - the objective is to find a linear ordering of the co作者: Forehead-Lift 時間: 2025-3-31 12:03
Online Minimum Spanning Trees with Weight Predictions,r the weights of all edges. Then the actual weights arrive one at a time and an irrevocable decision must be made regarding whether or not the edge should be included into the spanning tree. In order to assess the quality of our algorithms, we define an appropriate error measure and analyze the perf作者: 鋼盔 時間: 2025-3-31 16:51
,Compact Distance Oracles with?Large Sensitivity and?Low Stretch,most . edges of ., the oracle returns an estimate . of the distance . between . and . in the graph . such that ...For any positive integer . and any ., we present an .-DSO with sensitivity ., stretch ., space ., and an . query time..Prior to our work, there were only three known .-DSOs with subquadr作者: breadth 時間: 2025-3-31 18:28
,Finding Diameter-Reducing Shortcuts in?Trees,n two distinct vertices . and . of ., can answer queries reporting the cost of the edge (.,?.) in constant time. We want to augment . with . shortcuts in order to minimize the diameter of the resulting graph..For ., . time algorithms are known both for paths [Wang, CG 2018] and trees [Bilò, TCS 2022作者: Expiration 時間: 2025-4-1 00:34
,Approximating the?Smallest ,-Enclosing Geodesic Disc in?a?Simple Polygon, . vertices, . of which are reflex vertices. We refer to such a disc as a SKEG disc. We present an algorithm to compute a SKEG disc using higher-order geodesic Voronoi diagrams with worst-case time . ignoring polylogarithmic factors..We then present a 2-approximation algorithm that finds a geodesic 作者: INTER 時間: 2025-4-1 04:13
,Online Interval Scheduling with?Predictions,In the more general disjoint path allocation problem, the input is a sequence of requests, each involving a pair of vertices of a known graph, and the goal is to accept a maximum number of requests forming edge-disjoint paths between accepted pairs. These problems have been studied under extreme set作者: EVADE 時間: 2025-4-1 09:36 作者: JADED 時間: 2025-4-1 13:34 作者: Callus 時間: 2025-4-1 16:56
,Sublinear-Space Streaming Algorithms for?Estimating Graph Parameters on?Sparse Graphs,ng set and maximum matching – on sparse graph classes, i.e., graphs which satisfy . where .,?. is the number of edges, vertices respectively. Each graph parameter we consider can have size . even on sparse graph classes, and hence for sublinear-space algorithms we are restricted to parameter estimat作者: lymphoma 時間: 2025-4-1 22:30
