( en | de | ru )

 

Disambiguation of "Sarvottamananda, Swami"

Author of the publication

copydeleteadd this publication to your clipboard
Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints.

, , and . Discret. Appl. Math., (2020)

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. You can also use the button next to the name to display some publications already assigned to the person.

Sushmitha Swaminathan

Ashwin Swaminathan

Sushmitha Swaminathan

Srinivasan Swaminathan

Mani Swaminathan

 

Other publications of authors with the same name

Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions., , and . Discret. Appl. Math., (2021)Computing the Minkowski Sum of Convex Polytopes in Rd., and . CoRR, (2018)A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes., , and . CALDAM, volume 12601 of Lecture Notes in Computer Science, page 179-195. Springer, (2021)Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity., , and . CALDAM, volume 10156 of Lecture Notes in Computer Science, page 141-155. Springer, (2017)Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints., , and . Discret. Appl. Math., (2020)Optimizing movement in convex and non-convex path-networks to establish connectivity., , and . Discret. Appl. Math., (2020)Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions., , and . CALDAM, volume 10743 of Lecture Notes in Computer Science, page 283-300. Springer, (2018)Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function., , and . FAW, volume 9711 of Lecture Notes in Computer Science, page 41-52. Springer, (2016)Linear Time Algorithms for Euclidean 1-Center in R^d with Non-linear Convex Constraints., , and . CALDAM, volume 9602 of Lecture Notes in Computer Science, page 126-138. Springer, (2016)Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints., , , , and . COCOA, volume 12577 of Lecture Notes in Computer Science, page 515-529. Springer, (2020)