Berman
Piotr
polynomial-time approximation algorithm
chapter
free graphs
2022-09-02T16:16
In this paper we consider the following problem. Given is a d-claw free graph G = (V,E,w) where w: V → R+. Our algorithm finds an independent set A such that w(A*)/w(A)≤ d/2 where A* is an independent that maximizes w(A*). The previous best polynomial time approximation algorithm obtained w(A*)/w(A)≤ 2d/3.
independent
best polynomial-time approximation algorithm
graph
approximation algorithm
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
2000
graph G
time approximation algorithm
problem
free graph G
false
paper
https://scigraph.springernature.com/explorer/license/
chapters
approximation
algorithm
214-219
set
independent set
https://doi.org/10.1007/3-540-44985-x_19
2000-01-01
maximum weight independent set
Information and Computing Sciences
Dept. of Computer Science and Engineering, The Pennsylvania State University, USA
Dept. of Computer Science and Engineering, The Pennsylvania State University, USA
pub.1051241645
dimensions_id
978-3-540-44985-0
Algorithm Theory - SWAT 2000
978-3-540-67690-4
Springer Nature
Computation Theory and Mathematics
Springer Nature - SN SciGraph project
doi
10.1007/3-540-44985-x_19