Local optimality and its application on independent sets for \(k\)-claw free graphs

DOI10.1023/A:1009755815678zbMath0889.90152MaRDI QIDQ1369747

Gang Yu, Olivier Goldschmidt

Publication date: 17 December 1997

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

polynomial timeapproximation algorithms\(k\)-claw free graphslocally optimal independent sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (3)

A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling ⋮ Packing triangles in low degree graphs and indifference graphs ⋮ On the solution bound of two-sided scaffold filling

This page was built for publication: Local optimality and its application on independent sets for \(k\)-claw free graphs