A note on greedy algorithms for the maximum weighted independent set problem
type: Item
instance of: scholarly article
title: A note on greedy algorithms for the maximum weighted independent set problem
zbMATH Open document ID: 1013.90108
DOI: 10.1016/S0166-218X(02)00205-6
author: Shuichi Sakai
author: Mitsunori Togasaki
author: Koichi Yamazaki
published in: Discrete Applied Mathematics
publication date: 2003-03-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1878542
zbMATH Keywords: greedy algorithms
zbMATH Keywords: maximum weighted independent set
zbMATH Keywords: Caro-Wei theorem
MaRDI profile type: Publication
cites work: Q4004078
cites work: Q4099676
cites work: Small transversals in hypergraphs
cites work: Q5638352
cites work: Lower bounds on the independence number in terms of the degrees
cites work: Greed is good: Approximating independent sets in sparse and bounded-degree graphs
cites work: Stable sets and polynomials
cites work: The maximum clique problem
cites work: A probabilistic lower bound on the independence number of graphs
description: scientific article; zbMATH DE number 1878542