The following pages link to (Q3221758):
Displaying 50 items.
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Distributed approximation of cellular coverage (Q433421) (← links)
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- Local ratio with negative weights. (Q703278) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- An efficient approximation for the generalized assignment problem (Q845859) (← links)
- Approximating the minimum weight weak vertex cover (Q860818) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Approximating the 2-interval pattern problem (Q932323) (← links)
- The minimum substring cover problem (Q958306) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
- Equivalent approximation algorithms for node cover (Q1077934) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
- Impact of locality on location aware unit disk graphs (Q1662429) (← links)
- The generalized vertex cover problem and some variations (Q1756348) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Approximating the dense set-cover problem (Q1765297) (← links)
- On-line vertex-covering (Q1770381) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- Approximation algorithms for NMR spectral peak assignment. (Q1874392) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) (← links)
- Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover (Q4639895) (← links)
- (Q5140766) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- The Minimum Substring Cover Problem (Q5443381) (← links)
