Titlebook: Algorithms and Data Structures; 15th International S Faith Ellen,Antonina Kolokolova,Jörg-Rüdiger Sack Conference proceedings 2017 Springer

SPIR

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




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




书目名称Algorithms and Data Structures网络公开度




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




书目名称Algorithms and Data Structures被引频次




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




书目名称Algorithms and Data Structures年度引用




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




书目名称Algorithms and Data Structures读者反馈




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

craven

胰脏

垄断

,Der primäre Leberkrebs beim Tier,ic graph with bipartition (., .). In this paper we consider the maximum bichromatic plane spanning tree problem, which is the problem of computing a bichromatic plane spanning tree of maximum total edge length.

一再遛

Improved Algorithms for Computing ,-Sink on Dynamic Flow Path Networks, .(.) [.], in the general and uniform edge capacity cases, respectively. The above results are achieved by organizing relevant data for subpaths in a strategic way during preprocessing, and the final results are obtained by extracting/merging them in an efficient manner.

angina-pectoris

A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings,ursively splitting the graph into graphs called umbrellas). We argue that the height of any poly-line drawing must be at least the umbrella depth, and then devise an algorithm that achieves height at most twice the umbrella depth.

Amendment

Brittle

institute

Der Praktiker in der Werkstatt,ount of request a replica can serve. The problem falls under the general framework of capacitated set cover. It admits an .-approximation and it is NP-hard to approximate within a factor of .. We study the problem in terms of the treewidth . of the graph and present an .(.)-approximation algorithm.

Affluence

https://doi.org/10.1007/978-3-642-50711-3orial properties of the Strassen computational directed acyclic graph (CDAG). Applications to parallel computation are also developed. The result generalizes a similar bound previously obtained under the constraint of no-recomputation, that is, that intermediate results cannot be computed more than once.