A Greedy Heuristic for the Set-Covering Problem
From MaRDI portal
Publication:3887227
Cited in
(only showing first 100 items - show all)- Minimum partition of an independence system into independent sets
- Solving multiple scenarios in a combinatorial auction
- Path hitting in acyclic graphs
- Approximating the traffic grooming problem
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- An application of the greedy heuristic of set cover to traffic checks
- Independent sets in bounded-degree hypergraphs
- The greedy algorithm for domination in graphs of maximum degree 3
- Weighted sum coloring in batch scheduling of conflicting jobs
- Parameterized learnability of juntas
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
- Mechanism design for set cover games with selfish element agents
- Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis
- Mining Pareto-optimal modules for delayed product differentiation
- Efficient bounds for the stable set, vertex cover and set packing problems
- Equivalent approximation algorithms for node cover
- Optimal attribute sets for identifications and diagnoses
- Conditional covering: greedy heuristics and computational results
- Entropy and set covering
- Hierarchical approach to the process planning problem
- Solving large set covering problems on a personal computer
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- A probabilistic heuristic for a computationally difficult set covering problem
- Pick-and-choose heuristics for partial set covering
- Conditional clusters, musters, and probability
- Approximation algorithms for hitting objects with straight lines
- Analysis of a greedy heuristic for finding small dominating sets in graphs
- Complexity of the repeaters allocating problem
- Parallel and serial heuristics for the minimum set cover problem
- Learning in parallel
- Processor optimization for flow graphs
- The multicovering problem
- A unified approximation algorithm for node-deletion problems
- Methods for task allocation via agent coalition formation
- Differential approximation algorithms for some combinatorial optimization problems
- Simple Lagrangian heuristic for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- A Lagrangian-based heuristic for large-scale set covering problems
- Approximating the weight of shallow Steiner trees
- On dependent randomized rounding algorithms
- Algorithms for large scale set covering problems
- Pareto optimality and a class of set covering heuristics
- A heuristic algorithm for the multi-criteria set-covering problems
- A set covering reformulation of the pure fixed charge transportation problem
- The maximum clique problem
- An approximation algorithm for the license and shift class design problem
- An experimental comparison of three heuristics for the WVCP
- A modified greedy heuristic for the set covering problem with improved worst case bound
- Learning Boolean concepts in the presence of many irrelevant features
- Optimization by ghost image processes in neural networks
- A theory for memory-based learning
- Approximability of maximum splitting of k-sets and some other Apx-complete problems
- Solving large set covering problems for crew scheduling
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- Rounding algorithms for covering problems
- The design of a 0-1 integer optimizer and its application in the Carmen system
- Negotiation and cooperation in multi-agent environments
- Approximating covering integer programs with multiplicity constraints
- Hereditary systems and greedy-type algorithms.
- Two sensitivity theorems in fuzzy integer programming.
- A neural network for the minimum set covering problem
- On the distribution of the domination number for random class cover catch digraphs
- Fast stabbing of boxes in high dimensions
- Generalized submodular cover problems and applications
- A mixed-mode BIST scheme based on folding compression
- Theoretical complexity of grid cover problems used in radar applications
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- A new approximation algorithm for k-set cover problem
- Carousel greedy: a generalized greedy algorithm with applications in optimization
- Calculating approximation guarantees for partial set cover of pairs
- The k-hop connected dominating set problem: approximation and hardness
- A simple approximation algorithm for minimum weight partial connected set cover
- New pairwise spanners
- Homomorphic secret sharing for low degree polynomials
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
- Energy efficient low-cost virtual backbone construction for optimal routing in wireless sensor networks
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
- A tolerance function for the multiobjective set covering problem
- Designing cost-sharing methods for Bayesian games
- Online dominating set
- A set-cover-based approach for the test-cost-sensitive attribute reduction problem
- Covering arrays via set covers
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Towards flexible demands in online leasing problems
- An optimization model for freight transport using urban rail transit
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example
- On approximation of the vertex cover problem in hypergraphs
- Lift-and-project methods for set cover and knapsack
- Offline and online facility leasing
- Heuristic methods and applications: A categorized survey
- An analysis of the greedy algorithm for the submodular set covering problem
- Algorithms for multicast connection under multi-path routing model.
- Stock selection heuristics for interdependent items
- A fuzzy genetic algorithm for driver scheduling
- Scheduling of conditional executed jobs on unrelated processors
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- Almost optimal set covers in finite VC-dimension
- Min-energy broadcast in mobile ad hoc networks with restricted motion
- Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming
- Strengthening hash families and compressive sensing
This page was built for publication: A Greedy Heuristic for the Set-Covering Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887227)
