Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric ...

Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted ...

With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).

Institute of Mathematics, National Academy of Sciences of the Republic of Armenia, Yerevan, Armenia. Let’s start with an excursion into the two-century history of studying the classical Fourier series ...

Abstract: In this paper, we propose the Priority Facility Location Problem with Outliers (PFLPO), which is a generalization of both the Facility Location Problem with Outliers (FLPO) and Priority ...

1 Department of Computer Science, OsloMet—Oslo Metropolitan University, Oslo, Norway 2 Department of Informatics, University of Oslo, Oslo, Norway Elasticsearch is currently the most popular search ...