scientific article
From MaRDI portal
Publication:3221758
zbMath0557.90072MaRDI QIDQ3221758
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (53)
Equivalent approximation algorithms for node cover ⋮ Approximation algorithms for NMR spectral peak assignment. ⋮ Linear kernels for separating a graph into components of bounded size ⋮ Flexible bandwidth assignment with application to optical networks ⋮ Graph separators: A parameterized view ⋮ Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique ⋮ An efficient approximation for the generalized assignment problem ⋮ Efficient approximation of convex recolorings ⋮ Approximating the minimum weight weak vertex cover ⋮ Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover ⋮ Impact of locality on location aware unit disk graphs ⋮ A primal-dual approach to approximation of node-deletion problems for matroidal properties ⋮ Local ratio method on partial set multi-cover ⋮ Optimization problems in dotted interval graphs ⋮ Reoptimization of NP-Hard Problems ⋮ Fully dynamic maintenance of vertex cover ⋮ Distributed approximation of cellular coverage ⋮ Bridging gap between standard and differential polynomial approximation: The case of bin-packing ⋮ Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem ⋮ A generalization of Nemhauser and Trotter's local optimization theorem ⋮ Approximating the 2-interval pattern problem ⋮ Why Is Maximum Clique Often Easy in Practice? ⋮ Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover ⋮ The minimum substring cover problem ⋮ Minimum vertex cover in ball graphs through local search ⋮ Approximating the tree and tour covers of a graph ⋮ The generalized vertex cover problem and some variations ⋮ Combination of parallel machine scheduling and vertex cover ⋮ Optimization problems in multiple subtree graphs ⋮ Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs ⋮ Approximating the dense set-cover problem ⋮ Approximation algorithm for the partial set multi-cover problem ⋮ Local ratio with negative weights. ⋮ Minimum vertex cover in rectangle graphs ⋮ On-line vertex-covering ⋮ Polynomial approximation algorithms with performance guarantees: an introduction-by-example ⋮ Improved upper bounds for vertex cover ⋮ On approximating minimum vertex cover for graphs with perfect matching ⋮ Linear kernelizations for restricted 3-Hitting Set problems ⋮ The Minimum Substring Cover Problem ⋮ An approximation algorithm for the \(l\)-pseudoforest deletion problem ⋮ A randomised approximation algorithm for the hitting set problem ⋮ A primal-dual algorithm for the minimum partial set multi-cover problem ⋮ A unified approximation algorithm for node-deletion problems ⋮ On approximation problems related to the independent set and vertex cover problems ⋮ On parameterized exponential time complexity ⋮ Strong and weak edges of a graph and linkages with the vertex cover problem ⋮ On problems without polynomial kernels ⋮ Unnamed Item ⋮ PTAS for connected vertex cover in unit disk graphs ⋮ Approximating minimum feedback vertex sets in hypergraphs ⋮ Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph ⋮ An improved approximation algorithm for vertex cover with hard capacities
This page was built for publication:
