A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Approximating the Minimum Spanning Tree Weight in Sublinear Time
SIAM Journal on Computing
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
SIAM Journal on Computing
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Constant-Time Approximation Algorithms via Local Improvements
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Approximating the distance to properties in bounded-degree and general sparse graphs
ACM Transactions on Algorithms (TALG)
An improved constant-time approximation algorithm for maximum~matchings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Local Graph Partitions for Approximation and Testing
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Parameter testing in bounded degree graphs of subexponential growth
Random Structures & Algorithms
| Hi-index | 0.00 |
We survey the recent research on algorithms that approximate the optimal solution size for problems such as vertex cover, maximum matching, and dominating set. Techniques developed for these problems have found applications in property testing in the boundeddegree graph model.