Gautam Das

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees	2024-07-05	Paper
A lower bound for approximating the geometric minimum weight matching Information Processing Letters	2016-06-16	Paper
Algorithms for computing best coverage path in the presence of obstacles in a sensor field Journal of Discrete Algorithms	2012-09-13	Paper
Optimally computing a shortest weakly visible line segment inside a simple polygon Computational Geometry	2002-09-03	Paper
Lower bounds for computing geometric spanners and approximate shortest paths Discrete Applied Mathematics	2001-01-01	Paper
Constructing degree-3 spanners with other sparseness properties Lecture Notes in Computer Science	1999-10-31	Paper
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees Algorithmica	1998-11-10	Paper
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees Algorithmica	1998-11-10	Paper
Geometric searching and link distance. (Extended abstract) Lecture Notes in Computer Science	1993-05-18	Paper

Research outcomes over time

This page was built for person: Gautam Das