Approximating weighted neighborhood independent sets

A neighborhood independent set (NI-set) is a subset of edges in a graph such that the closed neighborhood of any vertex contains at most one edge of the subset. Finding a maximum cardinality NI-set is an NP-complete problem. We consider the weighted version of this problem. For general graphs we giv...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2018
Materias:
Approximation algorithms
Graph algorithms
Weighted neighborhood independent set
Computational complexity
Problem solving
Approximation ratios
Diamond-free graphs
General graph
Independent set
Maximum degree
Polynomially solvable
Regular graphs
Graph theory
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v130_n_p11_Lin
http://hdl.handle.net/20.500.12110/paper_00200190_v130_n_p11_Lin
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares