( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minsum k-Sink Problem on Path Networks.

, , , , и . CoRR, (2018)

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.

Sara Binay

Subhamoy Bhattacharya

Chhaya Bhattacharya

Nupur Bhattacharya

Indrajit Bhattacharya

 

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

Linear-Time Fitting of a k-Step Function., , и . CALDAM, том 9602 из Lecture Notes in Computer Science, стр. 85-96. Springer, (2016)Computation of spatial skyline points., , , , , и . Comput. Geom., (2021)Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms., , , и . INFORMS J. Comput., 32 (3): 730-746 (2020)Linear-time fitting of a k-step function., , и . Discret. Appl. Math., (2020)A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons., , и . COCOON (2), том 14423 из Lecture Notes in Computer Science, стр. 69-81. Springer, (2023)Minsum k-sink problem on path networks., , , , и . Theor. Comput. Sci., (2020)The Weighted k-Center Problem in Trees for Fixed k., , и . ISAAC, том 149 из LIPIcs, стр. 27:1-27:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Geometric p-Center Problems with Centers Constrained to Two Lines., , , , , и . JCDCGG, том 9943 из Lecture Notes in Computer Science, стр. 24-36. Springer, (2015)Minsum k-Sink Problem on Path Networks., , , , и . CoRR, (2018)Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks., , и . Discret. Appl. Math., (2015)