A still better performance guarantee for approximate graph coloring
Information Processing Letters
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Approximation algorithms
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
Proving Integrality Gaps without Knowing the Linear Program
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
On the Power of Priority Algorithms for Facility Location and Set Cover
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Toward a Model for Backtracking and Dynamic Programming
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Models of Greedy Algorithms for Graph Problems
Algorithmica
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Priority algorithms for graph optimization problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
A list heuristic for vertex cover
Operations Research Letters
Bounds on greedy algorithms for MAX SAT
ESA'11 Proceedings of the 19th European conference on Algorithms
On sum coloring and sum multi-coloring for restricted families of graphs
Theoretical Computer Science
Priority algorithms for graph optimization problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
| Hi-index | 5.23 |
We continue the study of priority or ''greedy-like'' algorithms as initiated in Borodin et al. (2003) [10] and as extended to graph theoretic problems in Davis and Impagliazzo (2009) [12]. Graph theoretic problems pose some modeling problems that did not exist in the original applications of Borodin et al. and Angelopoulos and Borodin (2002) [3]. Following the work of Davis and Impagliazzo, we further clarify these concepts. In the graph theoretic setting, there are several natural input formulations for a given problem and we show that priority algorithm bounds in general depend on the input formulation. We study a variety of graph problems in the context of arbitrary and restricted priority models corresponding to known ''greedy algorithms''.