Una metaheurística GRASP para integración en grafos

Autores
Dubinsky, Manuel; Massri, César; Asteasuain, Fernando
Año de publicación
2017
Idioma
español castellano
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Given an edge-weighted graph, we analyze the problem of finding an orientation of its edges and a function on its nodes, such that for each oriented edge the consistent subtraction of the function on its incident vertices (ie.: head - tail), is the best approximation in a least square sense to the original edge-weighted function. We present a simple GRASP algorithm to find a “good” solution that is suitable for distributed execution.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Graph algorithms
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/66445
Acceder
id SEDICI_16eae17c0c51e0e0dae848d38a4532d4
oai_identifier_str oai:sedici.unlp.edu.ar:10915/66445
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Una metaheurística GRASP para integración en grafosDubinsky, ManuelMassri, CésarAsteasuain, FernandoCiencias InformáticasGraph algorithmsGiven an edge-weighted graph, we analyze the problem of finding an orientation of its edges and a function on its nodes, such that for each oriented edge the consistent subtraction of the function on its incident vertices (ie.: head - tail), is the best approximation in a least square sense to the original edge-weighted function. We present a simple GRASP algorithm to find a “good” solution that is suitable for distributed execution.Sociedad Argentina de Informática e Investigación Operativa2017-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf36-44http://sedici.unlp.edu.ar/handle/10915/66445spainfo:eu-repo/semantics/altIdentifier/url/http://www.clei2017-46jaiio.sadio.org.ar/sites/default/files/Mem/SIO/sio-12.pdfinfo:eu-repo/semantics/altIdentifier/issn/2451-7550info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-sa/4.0/Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T11:01:58Zoai:sedici.unlp.edu.ar:10915/66445Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 11:01:58.644SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Una metaheurística GRASP para integración en grafos
title Una metaheurística GRASP para integración en grafos
spellingShingle Una metaheurística GRASP para integración en grafos
Dubinsky, Manuel
Ciencias Informáticas
Graph algorithms
title_short Una metaheurística GRASP para integración en grafos
title_full Una metaheurística GRASP para integración en grafos
title_fullStr Una metaheurística GRASP para integración en grafos
title_full_unstemmed Una metaheurística GRASP para integración en grafos
title_sort Una metaheurística GRASP para integración en grafos
dc.creator.none.fl_str_mv Dubinsky, Manuel
Massri, César
Asteasuain, Fernando
author Dubinsky, Manuel
author_facet Dubinsky, Manuel
Massri, César
Asteasuain, Fernando
author_role author
author2 Massri, César
Asteasuain, Fernando
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Graph algorithms
topic Ciencias Informáticas
Graph algorithms
dc.description.none.fl_txt_mv Given an edge-weighted graph, we analyze the problem of finding an orientation of its edges and a function on its nodes, such that for each oriented edge the consistent subtraction of the function on its incident vertices (ie.: head - tail), is the best approximation in a least square sense to the original edge-weighted function. We present a simple GRASP algorithm to find a “good” solution that is suitable for distributed execution.
Sociedad Argentina de Informática e Investigación Operativa
description Given an edge-weighted graph, we analyze the problem of finding an orientation of its edges and a function on its nodes, such that for each oriented edge the consistent subtraction of the function on its incident vertices (ie.: head - tail), is the best approximation in a least square sense to the original edge-weighted function. We present a simple GRASP algorithm to find a “good” solution that is suitable for distributed execution.
publishDate 2017
dc.date.none.fl_str_mv 2017-09
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/66445
url http://sedici.unlp.edu.ar/handle/10915/66445
dc.language.none.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://www.clei2017-46jaiio.sadio.org.ar/sites/default/files/Mem/SIO/sio-12.pdf
info:eu-repo/semantics/altIdentifier/issn/2451-7550
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-sa/4.0/
Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-sa/4.0/
Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
dc.format.none.fl_str_mv application/pdf
36-44
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846064070543802368
score 13.22299

Publicaciones similares