scientific article; zbMATH DE number 1559541
From MaRDI portal
Publication:4526990
zbMath0962.68172MaRDI QIDQ4526990
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (58)
Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs ⋮ Scheduling with conflicts: Online and offline algorithms ⋮ Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation ⋮ An Improved Approximation Bound for Spanning Star Forest and Color Saving ⋮ Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms ⋮ Tight approximation bounds for combinatorial frugal coverage algorithms ⋮ Exact algorithms and applications for tree-like Weighted Set Cover ⋮ Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks ⋮ Approximating activation edge-cover and facility location problems ⋮ An improved approximation ratio for the jump number problem on interval orders ⋮ Capacitated Domination and Covering: A Parameterized Perspective ⋮ On a partition LP relaxation for min-cost 2-node connected spanning subgraphs ⋮ Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation ⋮ An improved approximation algorithm for the minimum 3-path partition problem ⋮ Optimizing restriction site placement for synthetic genomes ⋮ Approximation of the quadratic set covering problem ⋮ On the approximation ability of evolutionary optimization with application to minimum set cover ⋮ Improved approximation algorithms for minimum AND-circuits problem via \(k\)-set cover ⋮ 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 ⋮ A 6/5-approximation algorithm for the maximum 3-cover problem ⋮ Boolean functions with long prime implicants ⋮ A better differential approximation ratio for symmetric TSP ⋮ On the complexity of constructing minimum changeover cost arborescences ⋮ Independent dominating set problem revisited ⋮ Efficient sensor network design for continuous monitoring of moving objects ⋮ Temporal Vertex Cover with a Sliding Time Window ⋮ Tight Approximation Bounds for Greedy Frugal Coverage Algorithms ⋮ Dual parameterization of Weighted Coloring ⋮ Geometric hitting set for segments of few orientations ⋮ Tropical dominating sets in vertex-coloured graphs ⋮ 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 ⋮ Approximation algorithms for some vehicle routing problems ⋮ Temporal vertex cover with a sliding time window ⋮ New differential approximation algorithm for \(k\)-customer vehicle routing problem ⋮ On point covers of \(c-\)oriented polygons ⋮ Combinatorial optimization algorithms for radio network planning ⋮ A modified greedy algorithm for dispersively weighted 3-set cover ⋮ On \(f\)-domination: polyhedral and algorithmic results ⋮ The maximum saving partition problem ⋮ A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem ⋮ Approximation algorithm for the multicovering problem ⋮ Unnamed Item ⋮ An approximation algorithm for the partial vertex cover problem in hypergraphs ⋮ Parameterized Complexity of Directed Steiner Tree on Sparse Graphs ⋮ Approximation of the \(k\)-batch consolidation problem ⋮ A relaxation of the directed disjoint paths problem: a global congestion metric helps ⋮ A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. ⋮ On the Approximability of Some Haplotyping Problems ⋮ Efficient approximation algorithms for maximum coverage with group budget constraints ⋮ Covering the edges of bipartite graphs using \(K_{2,2}\) graphs ⋮ Dual parameterization of weighted coloring ⋮ Fast stabbing of boxes in high dimensions ⋮ Parameterized Algorithms for Generalized Domination ⋮ A local search 4/3-approximation algorithm for the minimum 3-path partition problem ⋮ Dual power assignment optimization and fault tolerance in WSNs
This page was built for publication:
