( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Faster Algorithms for k-Medians in Trees.

, , , , и . MFCS, том 2747 из Lecture Notes in Computer Science, стр. 218-227. Springer, (2003)

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

 

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

Characterizing LR-visibility polygons and related problems., и . Comput. Geom., 18 (1): 19-36 (2001)An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window.. CVGIP: Graphical Model and Image Processing, 53 (3): 269-270 (1991)Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible., и . ISAAC, том 1004 из Lecture Notes in Computer Science, стр. 22-31. Springer, (1995)A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree., и . COCOON, том 7434 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2012)Usefulness of Angle-Sweep over Line-Sweep.. FSTTCS, том 560 из Lecture Notes in Computer Science, стр. 390-419. Springer, (1991)Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times., , , и . ISAAC, том 5369 из Lecture Notes in Computer Science, стр. 800-811. Springer, (2008)Computing Shortest Transversals of Sets (Extended Abstract)., , , , , и . SCG, стр. 71-80. ACM, (1991)Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2., , и . CCCG, Carleton University, Ottawa, Canada, (2014)Approximation Algorithms for the Black and White Traveling Salesman Problem., , и . COCOON, том 4598 из Lecture Notes in Computer Science, стр. 559-567. Springer, (2007)On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm., и . J. Algorithms, 25 (1): 177-193 (1997)