Experimental analysis of approximation algorithms for the vertex cover and set covering problems
From MaRDI portal
Publication:2496053
DOI10.1016/j.cor.2005.03.030zbMath1110.90083OpenAlexW2055687752MaRDI QIDQ2496053
Gerardo Valdisio R. Viana, Panos M. Pardalos, Fernando C. Gomes, Cláudio N. Meneses
Publication date: 30 June 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.03.030
Related Items
Cellular automata rules solving the wireless sensor network coverage problem ⋮ A graph approach for fuzzy-rough feature selection ⋮ \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems ⋮ On a posterior evaluation of a simple greedy method for set packing ⋮ Exact solutions to generalized vertex covering problems: a comparison of two models ⋮ The relationship between attribute reducts in rough sets and minimal vertex covers of graphs ⋮ A fast attribute reduction method for large formal decision contexts ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method
Uses Software
Cites Work
- Unnamed Item
- Efficient bounds for the stable set, vertex cover and set packing problems
- Computational experience with approximation algorithms for the set covering problem
- Designing and reporting on computational experiments with heuristic methods
- Resynchronization for multiprocessor DSP systems
- Modeling and Solving the Crew Rostering Problem
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time approximation algorithm for the weighted vertex cover problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Vertex packings: Structural properties and algorithms
- Adapting Branch-and-Bound for Real-World Scheduling Problems
