標(biāo)題: Titlebook: Algorithms and Data Structures; 16th International S Zachary Friggstad,J?rg-Rüdiger Sack,Mohammad R Sal Conference proceedings 2019 Springe [打印本頁] 作者: Fuctionary 時(shí)間: 2025-3-21 17:44
書目名稱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é)科排名
作者: Blood-Clot 時(shí)間: 2025-3-21 20:40 作者: Harass 時(shí)間: 2025-3-22 02:57 作者: 認(rèn)為 時(shí)間: 2025-3-22 08:23 作者: mortuary 時(shí)間: 2025-3-22 12:39 作者: 辯論的終結(jié) 時(shí)間: 2025-3-22 15:14 作者: Concomitant 時(shí)間: 2025-3-22 21:07 作者: 折磨 時(shí)間: 2025-3-22 23:19 作者: Dna262 時(shí)間: 2025-3-23 03:34
A Framework for Vehicle Routing Approximation Schemes in Trees,blems, the goal is to optimally route a fleet of vehicles, originating at a depot, to serve a set of clients, subject to various constraints. For example, in ., the number of vehicles is fixed, and the objective is to minimize the longest distance traveled by a single vehicle. Our main insight is th作者: 發(fā)誓放棄 時(shí)間: 2025-3-23 06:25
Avoidable Vertices and Edges in Graphs,on the existence of simplicial vertices in chordal graphs, Ohtsuki et al.?proved in 1976 that every graph has an avoidable vertex. In a different generalization, Chvátal et al.?gave in 2002 a characterization of graphs without long induced cycles based on the concept of simplicial paths. We introduc作者: PRO 時(shí)間: 2025-3-23 12:24
Plane Hop Spanners for Unit Disk Graphs,e plane and there is an edge between two points if and only if their Euclidean distance is at most one. A . for the UDG is a spanning subgraph . such that for every edge (.,?.) in the UDG the topological shortest path between . and . in . has a constant number of edges. The . of . is the maximum num作者: Longitude 時(shí)間: 2025-3-23 14:26
On the Minimum Consistent Subset Problem, in . has the same color as .. The consistent subset problem is to find a consistent subset of . with minimum cardinality. This problem is known to be NP-complete even for two-colored point sets. Since the initial presentation of this problem, aside from the hardness results, there has not been sign作者: 決定性 時(shí)間: 2025-3-23 21:43
Graph Isomorphism for ,-Free Graphs: An Almost Complete Dichotomy,zer settled the complexity of this problem restricted to .-free graphs for all but a finite number of pairs ., but without explicitly giving the number of open cases. Grohe and Schweitzer proved that . is polynomial-time solvable on graph classes of bounded clique-width. By combining known results w作者: 業(yè)余愛好者 時(shí)間: 2025-3-23 23:28 作者: Vital-Signs 時(shí)間: 2025-3-24 04:10 作者: EXCEL 時(shí)間: 2025-3-24 07:18
Online Bin Covering with Advice,s said to be covered if it receives items of total size at least 1. We study this problem in the advice setting and provide tight bounds for the size of advice required to achieve optimal solutions. Moreover, we show that any algorithm with advice of size . has a competitive ratio of at most 0.5. In作者: Assignment 時(shí)間: 2025-3-24 11:49
Stackelberg Packing Games,st feasible subset of the items. The goal of the leader is to maximize her revenue, which is determined by the sold items and their prices. Typically, the follower’s feasible subsets are given by a combinatorial covering problem. In the Stackelberg shortest path game, for example, the items are edge作者: 手勢(shì) 時(shí)間: 2025-3-24 15:12
,FRESH: Fréchet Similarity with Hashing,d ., construct a data structure that, for any query curve ., efficiently returns all entries in . with distance at most . from .. We propose FRESH, an approximate and randomized approach for .-range search, that leverages on a locality sensitive hashing scheme for detecting candidate near neighbors 作者: Ccu106 時(shí)間: 2025-3-24 21:37
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153154.jpg作者: calamity 時(shí)間: 2025-3-25 00:08
https://doi.org/10.1007/978-3-030-24766-9approximation algorithms; artificial intelligence; directed graphs; graph theory; graphic methods; proble作者: Introduction 時(shí)間: 2025-3-25 04:57 作者: 隨意 時(shí)間: 2025-3-25 09:36
Algorithms and Data Structures978-3-030-24766-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 填料 時(shí)間: 2025-3-25 13:43 作者: 贊成你 時(shí)間: 2025-3-25 17:27
D. Ockert,E. Hagmüller,M. Nagel,L. W. Storz .. In the . the task is to find a maximum .-bounded flow between a given pair of vertices in the input graph..The problem can be solved in polynomial time using linear programming. However, as far as we know, no polynomial-time combinatorial algorithm for the .-bounded flow is known. The only attem作者: 嬰兒 時(shí)間: 2025-3-25 22:29 作者: 高度贊揚(yáng) 時(shí)間: 2025-3-26 03:12 作者: HEPA-filter 時(shí)間: 2025-3-26 06:50 作者: Hearten 時(shí)間: 2025-3-26 09:38
,Medikament?se Okklusionsbehandlung,s the nominal sizes of the items and . their possible deviations. We consider more specifically two uncertainty sets previously studied in the literature. The first set, denoted ., contains scenarios in which at most . items deviate, each of them reaching its peak value ., while each other item has 作者: dyspareunia 時(shí)間: 2025-3-26 16:10 作者: llibretto 時(shí)間: 2025-3-26 17:07 作者: 贊成你 時(shí)間: 2025-3-27 00:16 作者: 變色龍 時(shí)間: 2025-3-27 03:21 作者: Canopy 時(shí)間: 2025-3-27 06:01
https://doi.org/10.1007/978-3-322-88512-8e plane and there is an edge between two points if and only if their Euclidean distance is at most one. A . for the UDG is a spanning subgraph . such that for every edge (.,?.) in the UDG the topological shortest path between . and . in . has a constant number of edges. The . of . is the maximum num作者: 脆弱帶來 時(shí)間: 2025-3-27 12:40 作者: Chronic 時(shí)間: 2025-3-27 15:42 作者: conception 時(shí)間: 2025-3-27 19:30
Schreiben mit dem Wohnzimmer-PC, we use an arbitrary convex shape .. Let . be a point set in the plane. The .-order Delaunay graph of ., denoted .-., has vertex set . and edge . provided that there exists . homothet of . with . and . on its boundary and containing at most . points of . different from . and .. The .-order Gabriel g作者: Flatus 時(shí)間: 2025-3-27 22:34
https://doi.org/10.1007/978-3-322-88509-8urve is attached to the boundary of the disk. Given an outerstring graph representation, the . (.) problem of the underlying graph can be solved in . time, where . is the number of segments in the representation (Keil et al., Comput. Geom., 60:19–25, 2017). If the strings are of constant size (e.g.,作者: Irritate 時(shí)間: 2025-3-28 05:58
https://doi.org/10.1007/978-3-322-88509-8s said to be covered if it receives items of total size at least 1. We study this problem in the advice setting and provide tight bounds for the size of advice required to achieve optimal solutions. Moreover, we show that any algorithm with advice of size . has a competitive ratio of at most 0.5. In作者: SEMI 時(shí)間: 2025-3-28 09:05 作者: 強(qiáng)壯 時(shí)間: 2025-3-28 12:59 作者: 可商量 時(shí)間: 2025-3-28 17:22 作者: prostate-gland 時(shí)間: 2025-3-28 19:40 作者: 品嘗你的人 時(shí)間: 2025-3-28 23:23 作者: 或者發(fā)神韻 時(shí)間: 2025-3-29 06:03 作者: Focus-Words 時(shí)間: 2025-3-29 09:07
Plane Hop Spanners for Unit Disk Graphs,he planarity or have high hop stretch factor. The only construction that satisfies both conditions is due to Catusse, Chepoi, and Vaxès [.]; their plane hop spanner has hop stretch factor at most 449..Our main result is a simple algorithm that constructs a plane hop spanner for the UDG. In addition 作者: surmount 時(shí)間: 2025-3-29 13:16
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives,resentations where the strings are .-monotone simple polygonal paths of constant length with segments at integral coordinates, we solve . in . time and show this to be the best possible under the strong exponential time hypothesis (SETH). For the intersection graph of . .-shapes in the plane, we giv作者: 令人心醉 時(shí)間: 2025-3-29 18:27 作者: fodlder 時(shí)間: 2025-3-29 20:06
Stackelberg Packing Games,related to scheduling..Our interest is the complexity of computing leader-optimal prices depending on different types of followers. As the main result, we show that the Stackelberg pricing game where the follower is given by the well-known interval scheduling problem is solvable in polynomial time. 作者: irreducible 時(shí)間: 2025-3-30 00:59
D. Ockert,E. Hagmüller,M. Nagel,L. W. Storzded flow in time . where . is the number of edges in the graph. Moreover, we show that this approach works even for the NP-hard generalization of the maximum .-bounded flow problem in which each edge has a length.作者: Fecundity 時(shí)間: 2025-3-30 05:25
Werner Lang,P. Klein,H. Schweigerhe size of the data structure and query time are nearly linear in the size of the input and query curve, respectively. The returned answer is either exact under ., or approximated to within a factor of . under?.. We also consider the variants in which the location of the input curves is only fixed u作者: mastoid-bone 時(shí)間: 2025-3-30 11:26 作者: beta-carotene 時(shí)間: 2025-3-30 15:29
https://doi.org/10.1007/978-3-322-89769-5 a close relationship between avoidable vertices in a graph and its minimal triangulations and identify new algorithmic uses of avoidable vertices. More specifically, applying Lexicographic Breadth First Search and bisimplicial elimination orderings, we derive a polynomial-time algorithm for the max作者: 珠寶 時(shí)間: 2025-3-30 18:18 作者: 撕裂皮肉 時(shí)間: 2025-3-30 22:52 作者: RECUR 時(shí)間: 2025-3-31 03:49 作者: Innocence 時(shí)間: 2025-3-31 08:23
https://doi.org/10.1007/978-3-322-84283-1related to scheduling..Our interest is the complexity of computing leader-optimal prices depending on different types of followers. As the main result, we show that the Stackelberg pricing game where the follower is given by the well-known interval scheduling problem is solvable in polynomial time. 作者: Facet-Joints 時(shí)間: 2025-3-31 12:17
Parameterized Complexity of Conflict-Free Graph Coloring,作者: Affiliation 時(shí)間: 2025-3-31 17:03 作者: Exuberance 時(shí)間: 2025-3-31 18:46 作者: 使顯得不重要 時(shí)間: 2025-3-31 23:22 作者: climax 時(shí)間: 2025-4-1 05:10 作者: urethritis 時(shí)間: 2025-4-1 08:15 作者: 儀式 時(shí)間: 2025-4-1 13:54
