Pages that link to "Item:Q816330"

The following pages link to On the hardness of approximating minimum vertex cover (Q816330):

Displaying 50 items.

• Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
• Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
• Vertex cover meets scheduling (Q270025) (← links)
• Component-cardinality-constrained critical node problem in graphs (Q299073) (← 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)
• Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
• Improved approximation of linear threshold functions (Q371200) (← 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)
• Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
• New techniques for approximating optimal substructure problems in power-law graphs (Q443723) (← links)
• A simple reduction from a biased measure on the discrete cube to the uniform measure (Q449220) (← links)
• Wildlife corridors as a connected subgraph problem (Q456412) (← links)
• An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families (Q458297) (← links)
• Improved and simplified inapproximability for \(k\)-means (Q506167) (← 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)
• Set systems without a simplex or a cluster (Q532128) (← links)
• Inapproximability of maximal strip recovery (Q551208) (← links)
• On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
• On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← 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)
• Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
• Exact localisations of feedback sets (Q722200) (← links)
• The ordered covering problem (Q722532) (← links)
• Approximability of clique transversal in perfect graphs (Q724231) (← 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)
• Models of greedy algorithms for graph problems (Q834580) (← links)
• Finding small stabilizers for unstable graphs (Q896265) (← links)
• On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
• Rounding to an integral program (Q943791) (← links)
• The 0-1 inverse maximum stable set problem (Q955316) (← links)
• A multiply intersecting Erdős-Ko-Rado theorem -- the principal case (Q960953) (← links)
• A better list heuristic for vertex cover (Q963417) (← links)
• Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
• Min sum clustering with penalties (Q976485) (← links)
• Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
• Routing to reduce the cost of wavelength conversion (Q1005233) (← links)
• Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
• Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
• On the hardness of approximating label-cover (Q1029090) (← links)
• Hardness of edge-modification problems (Q1034612) (← links)
• More complete intersection theorems (Q1618227) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)