標(biāo)題: Titlebook: Algorithms and Complexity; 10th International C Dimitris Fotakis,Aris Pagourtzis,Vangelis Th. Pasc Conference proceedings 2017 Springer Int [打印本頁] 作者: obdurate 時(shí)間: 2025-3-21 17:06
書目名稱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é)科排名
作者: 剝削 時(shí)間: 2025-3-21 20:33
Die Herstellung des Kesselbaustoffes,st a constant factor worse than the respective global optimum. In this paper, we show that single-swap applied to the weighted metric uncapacitated facility location and weighted discrete .-means problem is tightly PLS-complete and hence has exponential worst-case running time.作者: savage 時(shí)間: 2025-3-22 03:00
Die Herstellung des Kesselbaustoffes,ubgraph detection problems on multi-layer graphs, including fundamental problems such as maximum matching, finding certain clique relaxations (motivated by community detection), or path problems. Mostly encountering hardness results, sometimes even for two or three layers, we can also spot some islands of tractability.作者: 內(nèi)疚 時(shí)間: 2025-3-22 05:41 作者: Anticoagulants 時(shí)間: 2025-3-22 09:14
Assessing the Computational Complexity of Multi-layer Subgraph Detectionubgraph detection problems on multi-layer graphs, including fundamental problems such as maximum matching, finding certain clique relaxations (motivated by community detection), or path problems. Mostly encountering hardness results, sometimes even for two or three layers, we can also spot some islands of tractability.作者: 悲觀 時(shí)間: 2025-3-22 16:44 作者: 令人不快 時(shí)間: 2025-3-22 18:54 作者: 結(jié)束 時(shí)間: 2025-3-23 01:11 作者: –DOX 時(shí)間: 2025-3-23 02:25 作者: Spongy-Bone 時(shí)間: 2025-3-23 09:32
https://doi.org/10.1007/978-3-662-06524-2following related problem: Given a graph ., two vertices . and ., and a set of forbidden vertices ., find a minimum-cardinality set of trackers ., such that a shortest path . from . to . passes through a forbidden vertex if and only if it passes through a vertex of .. We present a polynomial-time (exact) algorithm for this problem.作者: 吹氣 時(shí)間: 2025-3-23 09:43 作者: TRAWL 時(shí)間: 2025-3-23 15:58
Tracking Pathsfollowing related problem: Given a graph ., two vertices . and ., and a set of forbidden vertices ., find a minimum-cardinality set of trackers ., such that a shortest path . from . to . passes through a forbidden vertex if and only if it passes through a vertex of .. We present a polynomial-time (exact) algorithm for this problem.作者: SLAG 時(shí)間: 2025-3-23 19:13
Almost Optimal Cover-Free Families lower order multiplicative terms, . . . .. In fact, our construction time is almost linear in the size of the family. Before our work, such a result existed only for ., and ...As a sample application, we improve the running times of parameterized algorithms from the recent work of Gabizon, Lokshtanov and Pilipczuk?[.].作者: lacrimal-gland 時(shí)間: 2025-3-24 00:46 作者: machination 時(shí)間: 2025-3-24 05:20 作者: 笨拙的我 時(shí)間: 2025-3-24 07:57 作者: blight 時(shí)間: 2025-3-24 12:52 作者: ELUC 時(shí)間: 2025-3-24 16:33 作者: 極大的痛苦 時(shí)間: 2025-3-24 20:28
Scheduling Maintenance Jobs in Networks solutions..Interestingly, the preemptive and the non-preemptive problem can be solved efficiently on paths, whereas we show that mixing both leads to a weakly NP-hard problem that allows for a simple 2-approximation.作者: KEGEL 時(shí)間: 2025-3-25 02:46 作者: inferno 時(shí)間: 2025-3-25 07:10
Improved Lower Bounds for Graph Embedding Problems .... appears to be the “correct” running time for many packing and embedding problems on restricted graph classes, and we think . and . form a useful framework for establishing lower bounds of this form.作者: Exuberance 時(shí)間: 2025-3-25 08:47
On the Complexity of the Star ,-hub Center Problem with Parameterized Triangle Inequalityoblem where . and . are functions of?.. If ., we have ., . .-S.HCP is polynomial time solvable. If ., we have .. For ., .. Moreover, for ., we have .. For ., the approximability of the problem (. upper and lower bound) is linear in ..作者: HAVOC 時(shí)間: 2025-3-25 13:12 作者: rheumatology 時(shí)間: 2025-3-25 16:48
Algorithms and Complexity978-3-319-57586-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: organism 時(shí)間: 2025-3-25 20:00 作者: adjacent 時(shí)間: 2025-3-26 00:44 作者: 充氣女 時(shí)間: 2025-3-26 04:33 作者: Fretful 時(shí)間: 2025-3-26 10:01
,Wasserlieferung und Wasserbilanz der B?den,sign of efficient exact and approximation algorithms for packing and scheduling problems. In order to obtain faster algorithms we studied integer linear programming (ILP) formulations for these problems and proved structural results for optimum solutions of the corresponding ILPs.作者: 總 時(shí)間: 2025-3-26 15:57 作者: PLIC 時(shí)間: 2025-3-26 20:12
https://doi.org/10.1007/978-3-642-47448-4st . such that ./. belongs to .. When . is the family of paths, trees or cacti, then the corresponding problems are ., . and ., respectively. It is known that . and . do not admit a polynomial kernel unless . . ., while . admits a kernel with . vertices. The starting point of this article are the fo作者: restrain 時(shí)間: 2025-3-26 22:30 作者: cancellous-bone 時(shí)間: 2025-3-27 04:05
Kerbzugdehnung und Umformeignung,ssumption .. . is a subclass of . that contains many of these problems. . and . share some complete problems under Cook reductions, the approximability of which does not extend to all problems in these classes (if .); the reason is that such reductions do not preserve the function value. Therefore C作者: DAUNT 時(shí)間: 2025-3-27 07:43 作者: 碳水化合物 時(shí)間: 2025-3-27 10:32
Die Herstellung des Kesselbaustoffes,side. In this paper, we study the complexity of finding an independent 2-clique of maximum size in several graph classes and we compare its complexity with the complexity of maximum independent set. We prove that this problem is NP-hard on apex graphs, APX-hard on line graphs, not .-approximable on 作者: 維持 時(shí)間: 2025-3-27 17:16
https://doi.org/10.1007/978-3-662-39555-4s, which we call . and ., and show that these cannot be solved in time ., unless the Exponential Time Hypothesis fails..These results are used to obtain simplified hardness results for several graph embedding problems, on more restricted graph classes than previously known: assuming the Exponential 作者: 不能根除 時(shí)間: 2025-3-27 19:38
Die Herstellung des Kesselbaustoffes,e center of the area and throughout the evacuation process they can only communicate with each other when they are at the same point at the same time. Having a visibility range of 0, the robots can only identify the location of the exit if they are already at the exit position. The task is to minimi作者: Employee 時(shí)間: 2025-3-28 00:01
Die Herstellung des Kesselbaustoffes, drops or swaps open facilities until it reaches a local optimum. For both problems, it is known that this algorithm produces a solution that is at most a constant factor worse than the respective global optimum. In this paper, we show that single-swap applied to the weighted metric uncapacitated fa作者: 航海太平洋 時(shí)間: 2025-3-28 05:35
Die Herstellung des Kesselbaustoffes,e associated via multiple types of relationships (edges in different layers). We chart the border of computational (in)tractability for the class of subgraph detection problems on multi-layer graphs, including fundamental problems such as maximum matching, finding certain clique relaxations (motivat作者: 吹牛大王 時(shí)間: 2025-3-28 09:24 作者: BUST 時(shí)間: 2025-3-28 12:19 作者: CLAY 時(shí)間: 2025-3-28 14:42
https://doi.org/10.1007/978-3-642-91983-1oal is to decide whether an instance remains positive after . (appropriately defined) perturbation has been applied to it. To tackle these kinds of problems, some of which might be of practical interest, we introduce a notion of resiliency for Integer Linear Programs (ILP) and show how to use a resu作者: 排斥 時(shí)間: 2025-3-28 22:06 作者: 連鎖 時(shí)間: 2025-3-29 01:32 作者: Ornithologist 時(shí)間: 2025-3-29 05:14 作者: 粘土 時(shí)間: 2025-3-29 10:03 作者: 騷擾 時(shí)間: 2025-3-29 14:07 作者: 浪費(fèi)物質(zhì) 時(shí)間: 2025-3-29 17:28
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153111.jpg作者: Relinquish 時(shí)間: 2025-3-29 21:21
https://doi.org/10.1007/978-3-642-92343-2The class TFNP was introduced a quarter of a century ago to capture problems in NP that have a witness for all inputs. A decade ago, this line of research culminated in the proof that the N. equilibrium problem is complete for the subclass PPAD. Here we review some interesting developments since.作者: 宿醉 時(shí)間: 2025-3-30 02:30 作者: Minikin 時(shí)間: 2025-3-30 05:59 作者: Admire 時(shí)間: 2025-3-30 12:01 作者: 宇宙你 時(shí)間: 2025-3-30 15:53 作者: 聽覺 時(shí)間: 2025-3-30 16:53
Temporal Flows in Temporal Networkshemeral in the sense that no link exists after some time. Our flow model is new and differs from the “flows over time” model, also called “dynamic flows” in the literature. We show that the problem of finding the maximum amount of flow that can pass from a source vertex . to a sink vertex . up?to a 作者: 障礙物 時(shí)間: 2025-3-30 21:23 作者: Ointment 時(shí)間: 2025-3-31 04:50 作者: Evocative 時(shí)間: 2025-3-31 08:36 作者: 思考而得 時(shí)間: 2025-3-31 11:54
Improved Lower Bounds for Graph Embedding Problemss, which we call . and ., and show that these cannot be solved in time ., unless the Exponential Time Hypothesis fails..These results are used to obtain simplified hardness results for several graph embedding problems, on more restricted graph classes than previously known: assuming the Exponential 作者: arboretum 時(shí)間: 2025-3-31 14:25
Collaboration Without Communication: Evacuating Two Robots from a Diske center of the area and throughout the evacuation process they can only communicate with each other when they are at the same point at the same time. Having a visibility range of 0, the robots can only identify the location of the exit if they are already at the exit position. The task is to minimi作者: 山崩 時(shí)間: 2025-3-31 20:53 作者: 存在主義 時(shí)間: 2025-4-1 01:41
Assessing the Computational Complexity of Multi-layer Subgraph Detectione associated via multiple types of relationships (edges in different layers). We chart the border of computational (in)tractability for the class of subgraph detection problems on multi-layer graphs, including fundamental problems such as maximum matching, finding certain clique relaxations (motivat作者: 膽小懦夫 時(shí)間: 2025-4-1 04:49 作者: BRACE 時(shí)間: 2025-4-1 07:05 作者: heirloom 時(shí)間: 2025-4-1 11:14 作者: Obligatory 時(shí)間: 2025-4-1 18:04 作者: Mindfulness 時(shí)間: 2025-4-1 19:03
