Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2020-04-29T17:37:56Z
dc.date.available 2020-04-29T17:37:56Z
dc.date.issued 2013
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/94585
dc.description.abstract Given a graph G and a nonnegative integer number k, a k- dominating set in G is a subset of vertices D such that every vertex in the graph is adjacent to at least k elements of D. The k-dominating set polytope is the convex hull of the incidence vectors of k-dominating sets in G. This is a natural generalization of the well-known dominating set polytope in graphs. In this work we study the 2-dominating set polytope of trees and we will provide new facet de ning inequalities for it. en
dc.format.extent 30-34 es
dc.language en es
dc.subject 2-domination es
dc.subject Facet es
dc.subject Tree es
dc.title New facets of the 2-dominating set polytope of trees en
dc.type Objeto de conferencia es
sedici.identifier.issn 1850-2865 es
sedici.creator.person Argiroffo, Gabriela es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Sociedad Argentina de Informática e Investigación Operativa es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.date.exposure 2013-09
sedici.relation.event XI Simposio Argentino de Investigación Operativa (SIO) - JAIIO 42 (2013) es
sedici.description.peerReview peer-review es


Descargar archivos

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)