Pages that link to "Item:Q2709886"

The following pages link to An improved approximation scheme for the Group Steiner Problem (Q2709886):

Displaying 19 items.

• Directed Steiner trees with diffusion costs (Q346492) (← links)
• A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
• Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
• On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
• Complexity of the minimum-length corridor problem (Q876503) (← links)
• Solving group Steiner problems as Steiner problems. (Q1420439) (← links)
• Generalized network design problems. (Q1810478) (← links)
• Solving the \(k\)-cardinality assignment problem by transformation (Q1877052) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
• Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
• The polymatroid Steiner problems (Q2569165) (← links)
• A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
• A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396) (← links)
• Online Buy-at-Bulk Network Design (Q4577806) (← links)
• Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
• $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)