Approximation Algorithms for the Set Covering and Vertex Cover Problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Minimum power partial multi-cover on a line
- Approximation algorithms for hitting objects with straight lines
- The multicovering problem
- Capacitated Domination Problem
- A modified greedy heuristic for the set covering problem with improved worst case bound
- On approximating partial scenario set cover
- FPT approximation for capacitated clustering with outliers
- Performance of a neural network method with set partitioning
- Pick-and-choose heuristics for partial set covering
- Optimal distributed covering algorithms
- Surrogate constraint normalization for the set covering problem
- The multi‐integer set cover and the facility terminal cover problem
- Partial multicuts in trees
- Forest covers
- Approximation of the quadratic set covering problem
- Online and approximate network construction from bounded connectivity constraints
- A simple rounding scheme for multistage optimization
- Distributed algorithms for covering, packing and maximum weighted matching
- A primal-dual algorithm for the minimum power partial cover problem
- Efficient approximation algorithms for maximum coverage with group budget constraints
- A Tight Bound for Stochastic Submodular Cover
- Reference points and approximation algorithms in multicriteria discrete optimization
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Equivalent approximation algorithms for node cover
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
- Database repairing with soft functional dependencies
- Clustering heuristics for set covering
- Evaluation of monotone DNF formulas
- Flip distance between triangulations of a planar point set is APX-hard
- Approximation of set multi-cover via hypergraph matching
- Online budgeted maximum coverage
- The set covering problem revisited: an empirical study of the value of dual information
- On parallelizing a greedy heuristic for finding small dominant sets
- A simple LP-free approximation algorithm for the minimum weight vertex cover problem
- Preserving approximation in the min-weighted set cover problem
- Limits of local search: quality and efficiency
- Exact and approximation algorithms for covering timeline in temporal graphs
- A graph approximation heuristic for the vertex cover problem on planar graphs
- Approximability of sparse integer programs
- New complexity results for the k-covers problem
- Approximating minimum feedback vertex sets in hypergraphs
- Timeline cover in temporal graphs: exact and approximation algorithms
- A 1/2-approximation algorithm for maximum interval multi-cover
- Randomized approximation for the set multicover problem in hypergraphs
- Capacitated domination problem
- A primal-dual approximation algorithm for \textsc{minsat}
- Finding small stabilizers for unstable graphs
- Fast stabbing of boxes in high dimensions
- Minimum vertex cover in rectangle graphs
- Pareto optimality and a class of set covering heuristics
- An articulation point-based approximation algorithm for minimum vertex cover problem
- A new fixed point approach for stable networks and stable marriages
- Approximation algorithm for prize-collecting weighted set cover with fairness constraints
- Geometric rounding: A dependent randomized rounding scheme
- An approximation algorithm for the k-prize-collecting hitting set problem
- Analysis of a greedy heuristic for finding small dominating sets in graphs
- Iterative partial rounding for vertex cover with hard capacities
- Vertex cover meets scheduling
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Approximation algorithms for the partition set cover problem with penalties
- Efficient bounds for the stable set, vertex cover and set packing problems
- A generalization of Nemhauser and Trotter's local optimization theorem
- Randomized approximation of bounded multicovering problems
- O(f) bi-criteria approximation for capacitated covering with hard capacities
- An improved approximation algorithm for vertex cover with hard capacities
- A randomised approximation algorithm for the hitting set problem
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Computing connected-k-subgraph cover with connectivity requirement
- An approximation algorithm for the partial vertex cover problem in hypergraphs
- Rounding to an integral program
- Online multiset submodular cover
- A fast approximation algorithm for the multicovering problem
- Database repairing with soft functional dependencies
- Simple Lagrangian heuristic for the set covering problem
- A packet filter placement problem with application to defense against spoofed denial of service attacks
- Combinatorics for smaller kernels: the differential of a graph
- Approximation algorithms for clique transversals on some graph classes
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems
- Approximation algorithm for the multicovering problem
- A unified approximation algorithm for node-deletion problems
- Heuristic methods and applications: A categorized survey
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
- On dependent randomized rounding algorithms
- Relaxing the strong triadic closure problem for edge strength inference
- Rounding algorithms for covering problems
- Capacitated domination: problem complexity and approximation algorithms
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
- Local ratio method on partial set multi-cover
- The generalized vertex cover problem and some variations
- Computational experience with approximation algorithms for the set covering problem
- On minimum t-claw deletion in split graphs
- Integrated Supply Chain Management via Randomized Rounding
- Semidefinite programming in combinatorial optimization
- Approximation algorithm for the partial set multi-cover problem
- Almost optimal set covers in finite VC-dimension
This page was built for publication: Approximation Algorithms for the Set Covering and Vertex Cover Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947140)
