scientific article; zbMATH DE number 1405697
From MaRDI portal
zbMATH Open0939.05076MaRDI QIDQ4938679FDOQ4938679
Authors: H. Y. Lau, Hing-Fung Ting 
Publication date: 5 July 2000
Title of this publication is not available (Why is that?)
Recommendations
- The greedier the better: an efficient algorithm for approximating maximum independent set
- Greed is good: approximating independent sets in sparse and bounded-degree graphs
- Greedy approximations of independent sets in low degree graphs
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
- Improved approximations of independent sets in bounded-degree graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (14)
- The potential of greed for independence
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- It is hard to know when greedy is good for finding independent sets
- The greedier the better: an efficient algorithm for approximating maximum independent set
- Performance analysis of greedy algorithms for Max-IS and Min-Maxl-Match
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs
- Greed is good: approximating independent sets in sparse and bounded-degree graphs
- A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem
- GreedyMAX-type algorithms for the maximum independent set problem
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
- On sequential heuristic methods 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 Q4938679)
