scientific article; zbMATH DE number 1559541
From MaRDI portal
Publication:4526990
Recommendations
- Packing-based approximation algorithm for the k-set cover problem
- Approximating k-set cover and complementary graph coloring
- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
- scientific article; zbMATH DE number 910871
Cited in
(63)- Approximation of the \(k\)-batch consolidation problem
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
- Fast stabbing of boxes in high dimensions
- A new approximation algorithm for k-set cover problem
- Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
- Approximation algorithms for some vehicle routing problems
- The maximum saving partition problem
- Improved approximation algorithms for minimum AND-circuits problem via \(k\)-set cover
- A 6/5-approximation algorithm for the maximum 3-cover problem
- Temporal vertex cover with a sliding time window
- Approximation algorithm for the multicovering problem
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem
- Approximating activation edge-cover and facility location problems
- On \(f\)-domination: polyhedral and algorithmic results
- Efficient approximation algorithms for maximum coverage with group budget constraints
- Dual power assignment optimization and fault tolerance in WSNs
- Tight approximation bounds for combinatorial frugal coverage algorithms
- An improved approximation algorithm for the minimum 3-path partition problem
- Approximation of the quadratic set covering problem
- Boolean functions with long prime implicants
- On the complexity of constructing minimum changeover cost arborescences
- A modified greedy algorithm for dispersively weighted 3-set cover
- Tight approximation bounds for greedy frugal coverage algorithms
- An Improved Approximation Bound for Spanning Star Forest and Color Saving
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- Capacitated Domination and Covering: A Parameterized Perspective
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
- On the Approximability of Some Haplotyping Problems
- An improved approximation ratio for the jump number problem on interval orders
- Optimizing restriction site placement for synthetic genomes
- On the approximation ability of evolutionary optimization with application to minimum set cover
- Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation
- A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
- Approximating k-set cover and complementary graph coloring
- Independent dominating set problem revisited
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
- Temporal vertex cover with a sliding time window
- Dual parameterization of weighted coloring
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps.
- Approximating activation edge-cover and facility location problems
- Improved Local Computation Algorithm for Set Cover via Sparsification
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
- Parameterized complexity of directed Steiner tree on sparse graphs
- Parameterized and Exact Computation
- Parameterized Algorithms for Generalized Domination
- On point covers of c-oriented polygons
- Combinatorial optimization algorithms for radio network planning
- An approximation algorithm for the partial vertex cover problem in hypergraphs
- Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach.
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
- A local search algorithm for the k-path partition problem
- An improved algorithm for finding maximum outerplanar subgraphs
- Uniform unweighted set cover: the power of non-oblivious local search
- Dual parameterization of weighted coloring
- Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
- Scheduling with conflicts: Online and offline algorithms
- Exact algorithms and applications for tree-like Weighted Set Cover
- A better differential approximation ratio for symmetric TSP
- Efficient sensor network design for continuous monitoring of moving objects
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Approximation hardness of dominating set problems in bounded degree graphs
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526990)
