Pages that link to "Item:Q414883"

The following pages link to Improved approximation algorithms for directed Steiner forest (Q414883):

Displaying 17 items.

• Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
• On minimum generalized Manhattan connections (Q832842) (← links)
• Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
• Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
• Approximating node-connectivity augmentation problems (Q2429349) (← links)
• Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
• Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
• Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (Q3460781) (← links)
• Online Buy-at-Bulk Network Design (Q4577806) (← links)
• Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
• ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
• Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
• How to Secure Matchings against Edge Failures (Q5157391) (← links)
• The Complexity of Contracts (Q5856150) (← links)
• Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
• Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane (Q6167087) (← links)