Titlebook: Combinatorial Algorithms; 27th International W Veli Mäkinen,Simon J. Puglisi,Leena Salmela Conference proceedings 2016 Springer Internation

闸门

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




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




书目名称Combinatorial Algorithms网络公开度




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




书目名称Combinatorial Algorithms被引频次




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




书目名称Combinatorial Algorithms年度引用




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




书目名称Combinatorial Algorithms读者反馈




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

Agronomy

Situative Content-Marketing-Strategieall possible scenarios is minimized. We propose an . time algorithm for the minimax regret 1-median problem in dynamic path networks with uniform capacity, where . is the number of vertices in the network.

东西

Evangelism in Social Networks number of . individuals? We prove that the problem is hard to solve, even in an approximate sense, and we present exact polynomial time algorithms for trees and complete graphs. For general graphs, we derive exact algorithms parameterized with respect to neighborhood diversity. We also study the pr

疯狂

Minimax Regret 1-Median Problem in Dynamic Path Networksall possible scenarios is minimized. We propose an . time algorithm for the minimax regret 1-median problem in dynamic path networks with uniform capacity, where . is the number of vertices in the network.

EXTOL

Lipoprotein

https://doi.org/10.1007/978-3-322-94990-5a color to each incoming vertex . so that the revealed graph is properly colored. The exact location of . in the graph . is not known to the algorithm, since it sees only previously colored neighbors of .. The . of . is the smallest number of colors such that some online algorithm is able to properl

Lipoprotein

枯萎将要

Zur Konstruktion von Wirklichkeitening that when two disks touch, the one with lower priority is ‘crushed’. A straightforward algorithm has running time . which we improve to expected . where . is the ratio between largest and smallest radii amongst the disks. For a very natural application of this problem in the map rendering domain

assent

入会

Anlässe für Situationsklärungentite graph . contains a non-crossing spanning tree whose maximum degree is at most .; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas . at the Graph Drawing Symposium, 1996.