scientific article; zbMATH DE number 753971
From MaRDI portal
Publication:4698692
zbMATH Open0817.68088MaRDI QIDQ4698692FDOQ4698692
Magnús M. Halldórsson, Jaikumar Radhakrishnan
Publication date: 6 August 1995
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (16)
- Title not available (Why is that?)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
- Ultimate greedy approximation of independent sets in subcubic graphs
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
- Independent sets in graphs with triangles
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
- Improved approximations for maximum independent set via approximation chains
- The maximum independent union of cliques problem: complexity and exact approaches
- Independent sets in graphs
- Greedy approximations of independent sets in low degree graphs
- An approximation of the minimum vertex cover in a graph
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
- Approximating Maximum Clique by Removing Subgraphs
- Improved approximations of independent sets in bounded-degree graphs
Recommendations
- Improved approximations of independent sets in bounded-degree graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- On approximation properties of the independent set problem for low degree graphs 👍 👎
- Greed is good: approximating independent sets in sparse and bounded-degree graphs 👍 👎
- A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698692)
