The following pages link to (Q4526990):
Displaying 50 items.
- An improved approximation ratio for the jump number problem on interval orders (Q391978) (← links)
- Optimizing restriction site placement for synthetic genomes (Q418177) (← links)
- On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Efficient sensor network design for continuous monitoring of moving objects (Q936530) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Approximation of the \(k\)-batch consolidation problem (Q1006079) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- A new approximation algorithm for \(k\)-set cover problem (Q1639350) (← links)
- Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks (Q1662465) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- Improved approximation algorithms for minimum AND-circuits problem via \(k\)-set cover (Q1944076) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Approximation algorithm for the multicovering problem (Q2025081) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355) (← links)
- Dual power assignment optimization and fault tolerance in WSNs (Q2352357) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- Tight Approximation Bounds for Greedy Frugal Coverage Algorithms (Q3004668) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
- On the Approximability of Some Haplotyping Problems (Q3638438) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- A novel local search algorithm with configuration checking and scoring mechanism for the set <i>k</i>‐covering problem (Q4601636) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- Temporal Vertex Cover with a Sliding Time Window (Q5002837) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
