標(biāo)題: Titlebook: Algorithms and Complexity; 11th International C Pinar Heggernes Conference proceedings 2019 Springer Nature Switzerland AG 2019 approximati [打印本頁(yè)] 作者: Heel-Spur 時(shí)間: 2025-3-21 18:00
書目名稱Algorithms and Complexity影響因子(影響力)
書目名稱Algorithms and Complexity影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Complexity網(wǎng)絡(luò)公開度
書目名稱Algorithms and Complexity網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Complexity被引頻次
書目名稱Algorithms and Complexity被引頻次學(xué)科排名
書目名稱Algorithms and Complexity年度引用
書目名稱Algorithms and Complexity年度引用學(xué)科排名
書目名稱Algorithms and Complexity讀者反饋
書目名稱Algorithms and Complexity讀者反饋學(xué)科排名
作者: Diatribe 時(shí)間: 2025-3-21 22:11
https://doi.org/10.1007/978-3-658-06259-0e?. is a parameter and . is a function as small as possible. We investigate which parameters allow for such running times. To this end, we systematically explore a hierarchy of structural graph parameters.作者: Brochure 時(shí)間: 2025-3-22 01:18
Der Klimawandel-Diskurs in Chinas to be allocated to the agents. The reward of a realized project is fully allocated to its contributors, according to a simple proportional rule. Existence and computational complexity of pure Nash equilibria is addressed and their efficiency is investigated according to both the utilitarian and the egalitarian social function.作者: 止痛藥 時(shí)間: 2025-3-22 05:16
https://doi.org/10.1007/978-3-662-37024-7.-cut number of a path of length ., are proved. We also show that ., after rescaling, converges in distribution to a limit ., which has a complicated representation. The paper then briefly discusses the .-cut number of general graphs. We conclude by some analytic results which may be of interest.作者: Hot-Flash 時(shí)間: 2025-3-22 10:40 作者: Countermand 時(shí)間: 2025-3-22 16:41
Parameterized Complexity of Diameter,e?. is a parameter and . is a function as small as possible. We investigate which parameters allow for such running times. To this end, we systematically explore a hierarchy of structural graph parameters.作者: 玉米 時(shí)間: 2025-3-22 18:02
Project Games,s to be allocated to the agents. The reward of a realized project is fully allocated to its contributors, according to a simple proportional rule. Existence and computational complexity of pure Nash equilibria is addressed and their efficiency is investigated according to both the utilitarian and the egalitarian social function.作者: 短程旅游 時(shí)間: 2025-3-22 22:18
-cuts on a Path,.-cut number of a path of length ., are proved. We also show that ., after rescaling, converges in distribution to a limit ., which has a complicated representation. The paper then briefly discusses the .-cut number of general graphs. We conclude by some analytic results which may be of interest.作者: TOXIC 時(shí)間: 2025-3-23 03:20 作者: ETCH 時(shí)間: 2025-3-23 07:11
Quadratic Vertex Kernel for Split Vertex Deletion, design a kernel for this problem with . vertices, improving upon the previous cubic bound known. Also, by giving a simple reduction from the . problem, we establish that . does not admit a kernel with . edges, for any ., unless ..作者: outskirts 時(shí)間: 2025-3-23 13:41
Minimum Convex Partition of Point Sets,. as an integer program that is used both to solve the problem exactly and to design heuristics. Thorough experiments are conducted to compare these algorithms in terms of solution quality and runtime, showing that the duality gap is decidedly small and grows quite slowly with the instance size.作者: Endometrium 時(shí)間: 2025-3-23 16:09
Parameterized Complexity of Safe Set, kernel parameterized by the vertex cover number . unless ., but (3) it is fixed-parameter tractable (FPT) when parameterized by the neighborhood diversity ., and (4) it can be solved in time . for some double exponential function . where . is the clique-width. We also present (5) a faster FPT algorithm when parameterized by solution size.作者: 防止 時(shí)間: 2025-3-23 21:58 作者: 他很靈活 時(shí)間: 2025-3-23 22:45
0302-9743 xperimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity..978-3-030-17401-9978-3-030-17402-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Myocarditis 時(shí)間: 2025-3-24 02:28 作者: Inertia 時(shí)間: 2025-3-24 08:28
Conference proceedings 2019lexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity..作者: CURB 時(shí)間: 2025-3-24 12:52
Ethik in Zeiten des Klimawandels design a kernel for this problem with . vertices, improving upon the previous cubic bound known. Also, by giving a simple reduction from the . problem, we establish that . does not admit a kernel with . edges, for any ., unless ..作者: Legion 時(shí)間: 2025-3-24 15:58 作者: geometrician 時(shí)間: 2025-3-24 22:00 作者: 膠水 時(shí)間: 2025-3-25 01:33
https://doi.org/10.1007/978-3-662-37024-7how that, under the ETH, . and . cannot be solved in time?., and that . is NP-hard for every fixed?.. We then extend previous fixed-parameter tractability results and kernelizations for STC to the three variants with multiple edge colors or outline the limits of such an extension.作者: Allodynia 時(shí)間: 2025-3-25 05:42 作者: SSRIS 時(shí)間: 2025-3-25 11:05
https://doi.org/10.1007/978-3-662-37022-3This also motivates presenting some explicit branching algorithms for degree-bounded instances. e further discuss the ., measuring the distance of . to the closest set that can be extended, which results in natural optimization problems related to extension problems for which we discuss polynomial-time approximability.作者: 冷淡周邊 時(shí)間: 2025-3-25 13:30 作者: motor-unit 時(shí)間: 2025-3-25 19:14 作者: NUDGE 時(shí)間: 2025-3-25 23:43
https://doi.org/10.1007/978-3-7091-4803-7 behaves very differently from the classical edge search. On the other hand, if all edges of a particular label form a (connected) subtree of the input tree, then we show that optimal heterogeneous search strategy can be computed efficiently.作者: TRACE 時(shí)間: 2025-3-26 02:35 作者: 滴注 時(shí)間: 2025-3-26 08:14 作者: CHIP 時(shí)間: 2025-3-26 12:33
Complexity of Scheduling for DARP with Soft Ride Times,blem can be solved in polynomial time if all the ride time constraints are bounded by a constant. Lastly, we give a polynomial time algorithm for the instances where all the pickups precede all the deliveries in the sequence of stops.作者: landmark 時(shí)間: 2025-3-26 16:14
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set, These problems are “implicit” ., and thus admit an algorithm with running time ., a kernel with . vertices, and a 4-approximation algorithm. In this paper, we exploit the structure of the input graph to obtain a kernel for . with . vertices and . algorithms for . and . with running times . and ..作者: 不可磨滅 時(shí)間: 2025-3-26 18:02 作者: senile-dementia 時(shí)間: 2025-3-26 22:37 作者: 詩(shī)集 時(shí)間: 2025-3-27 01:33 作者: Mendacious 時(shí)間: 2025-3-27 05:57 作者: 敵意 時(shí)間: 2025-3-27 09:49 作者: 責(zé)難 時(shí)間: 2025-3-27 15:25
Algorithms and Complexity978-3-030-17402-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CUB 時(shí)間: 2025-3-27 21:37 作者: Excise 時(shí)間: 2025-3-28 00:07 作者: 分期付款 時(shí)間: 2025-3-28 04:22
Ethik in Zeiten des Klimawandelstatic graph is a star on . vertices. The aim of the exploration problem in a temporal star is to find a temporal walk which starts at the center of the star, visits all leaves, and eventually returns back to the center. We present here a systematic study of the computational complexity of this probl作者: 寡頭政治 時(shí)間: 2025-3-28 09:52
https://doi.org/10.1007/978-3-531-92258-4 such that all internal faces are empty convex polygons. In the Minimum Convex Partition Problem (.) one seeks to find a convex partition with the least number of faces. The complexity of the problem is still open and so far no computational tests have been reported. In this paper, we formulate the 作者: adroit 時(shí)間: 2025-3-28 12:10 作者: inventory 時(shí)間: 2025-3-28 16:33
https://doi.org/10.1007/978-3-658-06259-0 no .-time algorithm even in sparse graphs [Roditty and Williams, 2013]. To circumvent this lower bound we aim for algorithms with running time?. where?. is a parameter and . is a function as small as possible. We investigate which parameters allow for such running times. To this end, we systematica作者: Lymphocyte 時(shí)間: 2025-3-28 21:58 作者: intention 時(shí)間: 2025-3-28 22:54
Der Klimawandel-Diskurs in China positive weights expressing the capacity of a given agent to contribute to a given project. The realization of a project produces some reward that has to be allocated to the agents. The reward of a realized project is fully allocated to its contributors, according to a simple proportional rule. Exi作者: 搏斗 時(shí)間: 2025-3-29 03:15 作者: 使隔離 時(shí)間: 2025-3-29 07:38
https://doi.org/10.1007/978-3-662-37024-7. in?. at least one edge is weak. In this work, we study the following generalizations of . with?. different strong edge colors. In . an induced?. may receive two strong labels as long as they are different. In . and . we may additionally restrict the set of permitted colors for each edge of?.. We s作者: 策略 時(shí)間: 2025-3-29 14:57 作者: 帶子 時(shí)間: 2025-3-29 18:43
https://doi.org/10.1007/978-3-662-37022-3 . independent set) . with . (resp. .). Possibly contradicting intuition, these problems tend to be .-complete, even in graph classes where the classical problem can be solved efficiently. Yet, we exhibit some graph classes where the extension variant remains polynomial-time solvable. We also study 作者: DEFER 時(shí)間: 2025-3-29 20:26 作者: 條約 時(shí)間: 2025-3-30 03:51
https://doi.org/10.1007/978-3-662-38159-5n as a sequence of pickup and delivery stops, there exist polynomial time algorithms to find a schedule respecting these constraints, provided that there exists one. However, if no feasible schedule exists, the natural question is to find a schedule minimising constraint violations. We model a gener作者: Germinate 時(shí)間: 2025-3-30 06:07 作者: FLING 時(shí)間: 2025-3-30 08:52 作者: 感情脆弱 時(shí)間: 2025-3-30 14:35
https://doi.org/10.1007/978-3-662-37023-0micro-pipes (edges). We address the following . problem: given a collection . of droplets, is there a mixing graph that mixes . perfectly, producing only droplets whose concentration is the average concentration of .? We provide a complete characterization of such perfectly mixable sets and an effic作者: 河流 時(shí)間: 2025-3-30 17:47 作者: Indebted 時(shí)間: 2025-3-30 21:19 作者: receptors 時(shí)間: 2025-3-31 04:35 作者: 游行 時(shí)間: 2025-3-31 05:48
Quadratic Vertex Kernel for Split Vertex Deletion,re and interesting algorithmic properties making it one of the most well-studied special graph classes. In the .(.) problem, given a graph and a positive integer ., the objective is to test whether there exists a subset of at most . vertices whose deletion results in a split graph. In this paper, we作者: 轉(zhuǎn)折點(diǎn) 時(shí)間: 2025-3-31 10:28
The Temporal Explorer Who Returns to the Base,tatic graph is a star on . vertices. The aim of the exploration problem in a temporal star is to find a temporal walk which starts at the center of the star, visits all leaves, and eventually returns back to the center. We present here a systematic study of the computational complexity of this probl作者: 淡紫色花 時(shí)間: 2025-3-31 16:31
Minimum Convex Partition of Point Sets, such that all internal faces are empty convex polygons. In the Minimum Convex Partition Problem (.) one seeks to find a convex partition with the least number of faces. The complexity of the problem is still open and so far no computational tests have been reported. In this paper, we formulate the 作者: 無(wú)王時(shí)期, 時(shí)間: 2025-3-31 17:38
Parameterized Complexity of Safe Set,.] is adjacent to a larger component in .. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that (1) the problem is W[2]-hard when parameterized by the pathwidth . and cannot be solved in time . unless the ETH is false, (2) it admits no polynomial作者: Tortuous 時(shí)間: 2025-3-31 23:48
Parameterized Complexity of Diameter, no .-time algorithm even in sparse graphs [Roditty and Williams, 2013]. To circumvent this lower bound we aim for algorithms with running time?. where?. is a parameter and . is a function as small as possible. We investigate which parameters allow for such running times. To this end, we systematica作者: 鬧劇 時(shí)間: 2025-4-1 02:46 作者: 痛苦一下 時(shí)間: 2025-4-1 09:46
Project Games, positive weights expressing the capacity of a given agent to contribute to a given project. The realization of a project produces some reward that has to be allocated to the agents. The reward of a realized project is fully allocated to its contributors, according to a simple proportional rule. Exi作者: Anthrp 時(shí)間: 2025-4-1 10:37 作者: 可能性 時(shí)間: 2025-4-1 18:06
,Your Rugby Mates Don’t Need to Know Your Colleagues: Triadic Closure with Edge Colors,. in?. at least one edge is weak. In this work, we study the following generalizations of . with?. different strong edge colors. In . an induced?. may receive two strong labels as long as they are different. In . and . we may additionally restrict the set of permitted colors for each edge of?.. We s作者: 漂亮 時(shí)間: 2025-4-1 19:52
