Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Note on the independence number of triangle-free graphs, II
Journal of Combinatorial Theory Series A
A (&Dgr;/2)-approximation algorithm for the maximum independent set problem
Information Processing Letters
The traveling salesman problem with distances one and two
Mathematics of Operations Research
The NP-completeness column: an ongoing guide
Journal of Algorithms
On the complexity of approximating the independent set problem
Information and Computation
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
A modified greedy heuristic for the set covering problem with improved worst case bound
Information Processing Letters
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Average case analysis of greedy algorithms for optimisation problems on set systems
Theoretical Computer Science
Randomized graph products, chromatic numbers, and Lovasz j-function
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Handbook of combinatorics (vol. 2)
Computational Optimization and Applications
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Graph Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Improved approximations of independent sets in bounded-degree graphs via subgraph removal
Nordic Journal of Computing
Constructive - Non-constructive Approximation and Maximum Independent Set Problem
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Completeness in Approximation Classes
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Graphs and Hypergraphs
Combinatorial optimization algorithms for radio network planning
Theoretical Computer Science
A priori optimization for the probabilistic maximum independent set problem
Theoretical Computer Science
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Graph separators: a parameterized view
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Absolute o(logm) error in approximating random set covering: an average case analysis
Information Processing Letters
A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms
Computational Optimization and Applications
Greedy algorithms for on-line set-covering and related problems
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
uScan: a lightweight two-tier global sensing coverage design
Proceedings of the 4th international conference on Embedded networked sensor systems
uCast: Unified Connectionless Multicast for Energy Efficient Content Distribution in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Single machine precedence constrained scheduling is a vertex cover problem
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Asymmetric sensing by decoupling scheduling from switching
ACM SIGMOBILE Mobile Computing and Communications Review
Combinatorial optimization in system configuration design
Automation and Remote Control
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Absolute o( logm) error in approximating random set covering: an average case analysis
Information Processing Letters
On the complexity of local search for weighted standard set problems
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
RAR: A role-and-risk based flexible framework for secure collaboration
Future Generation Computer Systems
Inapproximability of b-matching in k-uniform hypergraphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
GAPs: Geospatial Abduction Problems
ACM Transactions on Intelligent Systems and Technology (TIST)
Approximating the unweighted k-set cover problem: greedy meets local search
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Discrete Applied Mathematics
On approximation of the vertex cover problem in hypergraphs
Discrete Optimization
ACM SIGCOMM Computer Communication Review
Greedy algorithms for on-line set-covering and related problems
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Large neighborhood local search for the maximum set packing problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Selecting queries from sample to crawl deep web data sources
Web Intelligence and Agent Systems
| Hi-index | 0.00 |
We survey approximation algorithms for some well-known and very natural combinatorial optimization problems, the minimum set covering, the minimum vertex covering, the maximum set packing, and maximum independent set problems; we discuss their approximation performance and their complexity. For already known results, any time we have conceived simpler proofs than those already published, we give these proofs, and, for the rest, we cite the simpler published ones. Finally, we discuss how one can relate the approximability behavior (from both a positive and a negative point of view) of vertex covering to the approximability behavior of a restricted class of independent set problems.