( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An optimal algorithm to solve the all-pair shortest path problem on interval graphs.

, , и . Networks, 22 (1): 21-35 (1992)

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.

Samatha Ravipati

Fausto Ravida

Somasundaram Ravindran

Mylapore Ravi

Holger Raviol

 

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

On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem., , , , , и . IPCO, том 2081 из Lecture Notes in Computer Science, стр. 170-184. Springer, (2001)Approximation algorithms for stochastic orienteering., , , и . SODA, стр. 1522-1538. SIAM, (2012)Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models., , , , и . SODA, стр. 2411-2428. SIAM, (2023)LAST but not Least: Online Spanners for Buy-at-Bulk., , , и . SODA, стр. 589-599. SIAM, (2017)Redeeming Nested Dissection: Parallelism Implies Fill., , , и . PPSC, (1999)Approximating k-cuts via network strength., и . SODA, стр. 621-622. ACM/SIAM, (2002)When cycles collapse: A general approximation technique for constrained two-connectivity problems., и . IPCO, стр. 39-55. CIACO, (1993)Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract). FOCS, стр. 202-213. IEEE Computer Society, (1994)Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems., , , и . STOC, стр. 100-105. ACM, (1998)Pricing Tree Access Networks with Connected Backbones., , , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 498-509. Springer, (2007)