From post

O(n log n)-Average-Time Algorithm for Shortest Network under a Given Topology.

, и . COCOON, том 1090 из Lecture Notes in Computer Science, стр. 11-20. Springer, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

A linear time algorithm for computing a most reliable source on a tree network with faulty nodes., и . Theor. Comput. Sci., 412 (3): 225-232 (2011)Diameter-Constrained Steiner Tree., , и . COCOA (2), том 6509 из Lecture Notes in Computer Science, стр. 243-253. Springer, (2010)A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree., и . COCOA (2), том 6509 из Lecture Notes in Computer Science, стр. 268-280. Springer, (2010)The Primal Simplex Approach to the QoS Routing Problem., , и . QSHINE, стр. 120-129. IEEE Computer Society, (2004)Establishment of survivable connections in WDM networks using partial path protection., , , и . ICC, стр. 1756-1760. IEEE, (2005)Computational Drug Discovery with Dyadic Positive-Unlabeled Learning., , , , , , и . SDM, стр. 45-53. SIAM, (2017)Quality-Aware and Fine-Grained Incentive Mechanisms for Mobile Crowdsensing., , , , и . ICDCS, стр. 354-363. IEEE Computer Society, (2016)EARS: Enabling Private Feedback Updates in Anonymous Reputation Systems., , , и . CNS, стр. 1-9. IEEE, (2020)You better be honest: Discouraging free-riding and false-reporting in mobile crowdsourcing., , , , и . GLOBECOM, стр. 4971-4976. IEEE, (2014)An Approach to QoS-based Task Distribution in Edge Computing Networks for IoT Applications., , , , и . EDGE, стр. 32-39. IEEE Computer Society, (2017)