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影響因子(影響力)學(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é)科排名

剝削

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.

內(nèi)疚

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.

悲觀

令人不快

結(jié)束

–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.