Pages that link to "Item:Q4993301"

The following pages link to ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301):

Displaying 6 items.

• A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
• Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
• Imperfect gaps in Gap-ETH and PCPs (Q5091784) (← links)
• (Q5875468) (← links)
• Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)