Pages that link to "Item:Q5057456"

The following pages link to On approximation properties of the Independent set problem for degree 3 graphs (Q5057456):

Displaying 20 items.

• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
• Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
• Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
• Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
• A note on the precedence-constrained class sequencing problem (Q868379) (← links)
• The longest common subsequence problem for arc-annotated sequences (Q876717) (← links)
• Simultaneous matchings: Hardness and approximation (Q931730) (← links)
• Reversal and transposition medians (Q1022594) (← links)
• Priority algorithms for graph optimization problems (Q1041242) (← links)
• The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
• Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
• Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
• Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
• The maximum clique problem in multiple interval graphs (Q2350898) (← links)
• Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
• When polynomial approximation meets exact computation (Q5892165) (← links)
• When polynomial approximation meets exact computation (Q5915964) (← links)
• Minus domination in small-degree graphs (Q5928868) (← links)
• On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows (Q6065863) (← links)