Pages that link to "Item:Q867859"

The following pages link to Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859):

Displaying 5 items.

• The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
• On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
• On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
• Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
• Popularity, Mixed Matchings, and Self-Duality (Q5000640) (← links)