Titlebook: Algorithms and Complexity; 10th International C Dimitris Fotakis,Aris Pagourtzis,Vangelis Th. Pasc Conference proceedings 2017 Springer Int

obdurate

书目名称Algorithms and Complexity影响因子(影响力)




书目名称Algorithms and Complexity影响因子(影响力)学科排名




书目名称Algorithms and Complexity网络公开度




书目名称Algorithms and Complexity网络公开度学科排名




书目名称Algorithms and Complexity被引频次




书目名称Algorithms and Complexity被引频次学科排名




书目名称Algorithms and Complexity年度引用




书目名称Algorithms and Complexity年度引用学科排名




书目名称Algorithms and Complexity读者反馈




书目名称Algorithms and Complexity读者反馈学科排名

剥削

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

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.

内疚

Anticoagulants

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.

悲观

令人不快

结束

–DOX

Spongy-Bone

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.