activity
20092013
most citedOptimal Geometric Partitions, Covers and K-Centers

3 citations · 7 across the 8 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2013

Line-Constrained Geometric Server Placement

Mugurel Ionut Andreica, Eliana-Dina Tirsa

In this paper we present new algorithmic solutions for several constrained geometric server placement problems. We consider the problems of computing the 1-center and obnoxious 1-c…

cs.DS2010

Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data

Mugurel Ionut Andreica, Eliana-Dina Tirsa

In this paper we present novel algorithms for several multidimensional data processing problems. We consider problems related to the computation of restricted clusters and of the d…

cs.DS2009★ 3 cited

Optimal Geometric Partitions, Covers and K-Centers

Mugurel Ionut Andreica, Eliana-Dina Tirsa, Cristina Teodora Andreica +2

In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as…

cs.DS2009★ 1 cited

Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems

Mugurel Ionut Andreica, Eliana-Dina Tirsa, Alexandru Costan +1

In this paper we address several network design, clustering and Quality of Service (QoS) optimization problems and present novel, efficient, offline algorithms which compute optima…

cs.DS2009★ 1 cited

Towards a Centralized Scheduling Framework for Communication Flows in Distributed Systems

Mugurel Ionut Andreica, Eliana-Dina Tirsa, Nicolae Tapus +2

The overall performance of a distributed system is highly dependent on the communication efficiency of the system. Although network resources (links, bandwidth) are becoming increa…