Pages that link to "Item:Q2475406"
From MaRDI portal
The following pages link to Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406):
Displayed 50 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- Vertex cover meets scheduling (Q270025) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Minimum vertex cover in generalized random graphs with power law degree distribution (Q306728) (← links)
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Exact and approximate algorithms for movement problems on (special classes of) graphs (Q338392) (← links)
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Improved approximation of linear threshold functions (Q371200) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- Kernelization for cycle transversal problems (Q423937) (← links)
- Improved approximation bounds for the student-project allocation problem with preferences over projects (Q450528) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- Approximate association via dissociation (Q505447) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Approximating integer programs with positive right-hand sides (Q656570) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- The ordered covering problem (Q722532) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- Robust approach to restricted items selection problem (Q828685) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Finding small stabilizers for unstable graphs (Q896265) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)