A
Adrian Dumitrescu
Researcher at University of Wisconsin–Milwaukee
Publications - 271
Citations - 2467
Adrian Dumitrescu is an academic researcher from University of Wisconsin–Milwaukee. The author has contributed to research in topics: Upper and lower bounds & Approximation algorithm. The author has an hindex of 24, co-authored 258 publications receiving 2246 citations. Previous affiliations of Adrian Dumitrescu include University of Mary Washington & Rutgers University.
Papers
More filters
Proceedings ArticleDOI
Approximation algorithms for TSP with neighborhoods in the plane
TL;DR: In the Euclidean TSP with neighborhoods (TSPN) with neighborhoods, this article gave a PTAS for the special case of disjoint unit disk neighborhoods, and a linear-time O(1)-approximation algorithm for neighborhoods that are (infinite) straight lines.
Journal ArticleDOI
Approximation algorithms for TSP with neighborhoods in the plane
TL;DR: In the Euclidean TSP with neighborhoods (TSPN) with neighborhoods, this paper gave a PTAS for the special case of disjoint unit disk neighborhoods, and a linear-time O(1)-approximation algorithm for neighborhoods that are (infinite) straight lines.
Journal ArticleDOI
On the Largest Empty Axis-Parallel Box Amidst n Points
Adrian Dumitrescu,Minghui Jiang +1 more
TL;DR: In this article, a (1−e)-approximation algorithm for the problem of finding an empty axis-aligned box whose volume is at least (1 − e) of the maximum was given.
Journal ArticleDOI
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
TL;DR: New lower and upper bounds for the maximum multiplicity of some weighted and, respectively, nonweighted common geometric graphs drawn on $n$ points in the plane in general position (with no three points collinear): perfect matchings, spanning trees, spanning cycles (tours), and triangulations are obtained.
Journal ArticleDOI
Compatible geometric matchings
Oswin Aichholzer,Sergey Bereg,Adrian Dumitrescu,Alfredo García,Clemens Huemer,Ferran Hurtado,Mikio Kano,Alberto Márquez,David Rappaport,Shakhar Smorodinsky,Diane L. Souvaine,Jorge Urrutia,David R. Wood +12 more
TL;DR: There is a sequence of perfect matchings M=M"0, M"1,...,M"k=M^', such that each M"i is compatible with M" i"+"1", which improves the previous best bound of k@?O(logn).