Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution

In this work, I present an optimization problem which consists of assigning entries of a stellar catalog to multiple entries of another stellar catalog such that the probability of such assignment is maximum. I show a way of modeling it as a Maximum Weighted Stable Set Problem which is further us...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Severín, Daniel Esteban
Formato: article artículo acceptedVersion
Lenguaje:Inglés
Publicado: Elsevier 2020
Materias:
Cross-identification
Complexity
Maximum Weighted Stable Set Problem
Forbidden subgraphs
http://biblio-int.mincyt.gob.ar/ford/1.3
Acceso en línea:http://hdl.handle.net/2133/18963
http://hdl.handle.net/2133/18963
Aporte de:
Repositorio Hipermedial de la Universidad Nacional de Rosario (UNR) de Universidad Nacional de Rosario
id I15-R121-2133-18963
record_format dspace
institution Universidad Nacional de Rosario
institution_str I-15
repository_str R-121
collection Repositorio Hipermedial de la Universidad Nacional de Rosario (UNR)
language Inglés
orig_language_str_mv eng
topic Cross-identification
Complexity
Maximum Weighted Stable Set Problem
Forbidden subgraphs
http://biblio-int.mincyt.gob.ar/ford/1.3
spellingShingle Cross-identification
Complexity
Maximum Weighted Stable Set Problem
Forbidden subgraphs
http://biblio-int.mincyt.gob.ar/ford/1.3
Severín, Daniel Esteban
Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
topic_facet Cross-identification
Complexity
Maximum Weighted Stable Set Problem
Forbidden subgraphs
http://biblio-int.mincyt.gob.ar/ford/1.3
description In this work, I present an optimization problem which consists of assigning entries of a stellar catalog to multiple entries of another stellar catalog such that the probability of such assignment is maximum. I show a way of modeling it as a Maximum Weighted Stable Set Problem which is further used to solve a real astronomical instance and I partially characterize the forbidden subgraphs of the resulting family of graphs given by that reduction. Finally, I prove that the problem is NP-Hard.
format article
artículo
acceptedVersion
author Severín, Daniel Esteban
author_facet Severín, Daniel Esteban
author_sort Severín, Daniel Esteban
title Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title_short Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title_full Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title_fullStr Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title_full_unstemmed Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title_sort cross-identification of stellar catalogs with multiple stars: complexity and resolution
publisher Elsevier
publishDate 2020
url http://hdl.handle.net/2133/18963
http://hdl.handle.net/2133/18963
work_keys_str_mv AT severindanielesteban crossidentificationofstellarcatalogswithmultiplestarscomplexityandresolution
bdutipo_str Repositorios
_version_ 1764820409930219522

Ejemplares similares