Pages that link to "Item:Q3910012"
From MaRDI portal
The following pages link to A linear-time approximation algorithm for the weighted vertex cover problem (Q3910012):
Displaying 50 items.
- Vertex cover meets scheduling (Q270025) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- LP-based covering games with low price of anarchy (Q493659) (← links)
- Capacitated domination problem (Q534769) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- A simple LP-free approximation algorithm for the minimum weight vertex cover problem (Q673599) (← links)
- Preserving approximation in the min-weighted set cover problem (Q674914) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Primal-dual schema for capacitated covering problems (Q747765) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- On the multi-radius cover problem (Q845720) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- Rounding to an integral program (Q943791) (← links)
- The minimum substring cover problem (Q958306) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Equivalent approximation algorithms for node cover (Q1077934) (← links)
- A fast approximation algorithm for the multicovering problem (Q1082267) (← links)
- Approximation algorithms for hitting objects with straight lines (Q1173978) (← links)
- Complexity of the repeaters allocating problem (Q1183426) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Pareto optimality and a class of set covering heuristics (Q1309875) (← links)
- Clustering heuristics for set covering (Q1309879) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- An experimental comparison of three heuristics for the WVCP (Q1328615) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
- Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
- \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities (Q1741845) (← links)
- Approximating the dense set-cover problem (Q1765297) (← links)
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
