Priority algorithms for graph optimization problems (Q1041242): Difference between revisions

@@ Property / author @@
+Joan. Boyar
@@ Property / author: Joan. Boyar / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.09.033
+Normal rank
@@ Property / OpenAlex ID @@
+W2136026170
@@ Property / OpenAlex ID: W2136026170 / rank @@
+Normal rank
@@ Property / cites work @@
+Toward a model for backtracking and dynamic programming
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411275
@@ Property / cites work: Q4411275 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002764
@@ Property / cites work: Q3002764 / rank @@
+Normal rank
@@ Property / cites work @@
+A list heuristic for vertex cover
@@ Property / cites work: A list heuristic for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Free Bits, PCPs, and Nonapproximability---Towards Tight Results
+Normal rank
@@ Property / cites work @@
+On approximation properties of the Independent set problem for degree 3 graphs
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+(Incremental) priority algorithms
@@ Property / cites work: (Incremental) priority algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Models of greedy algorithms for graph problems
@@ Property / cites work: Models of greedy algorithms for graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+The importance of being biased
@@ Property / cites work: The importance of being biased / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Zero knowledge and the chromatic number
@@ Property / cites work: Zero knowledge and the chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q2766829
@@ Property / cites work: Q2766829 / rank @@
+Normal rank
@@ Property / cites work @@
+A still better performance guarantee for approximate graph coloring
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating the chromatic number
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Truth revelation in approximately efficient combinatorial auctions
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+Priority algorithms for the subset-sum problem
@@ Property / cites work: Priority algorithms for the subset-sum problem / rank @@
+Normal rank