scientific article; zbMATH DE number 753971
From MaRDI portal
Publication:4698692
zbMath0817.68088MaRDI QIDQ4698692
Jaikumar Radhakrishnan, Magnús M. Halldórsson
Publication date: 6 August 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (11)
Independent sets in graphs with triangles ⋮ Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation ⋮ Improved approximations for maximum independent set via approximation chains ⋮ On the Lovász Theta Function for Independent Sets in Sparse Graphs ⋮ An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† ⋮ Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs ⋮ Independent sets in graphs ⋮ Greed is good: Approximating independent sets in sparse and bounded-degree graphs ⋮ An approximation of the minimum vertex cover in a graph ⋮ Unnamed Item ⋮ A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
This page was built for publication:
