Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201): Difference between revisions

@@ Property / cites work @@
+When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
+Normal rank
@@ Property / cites work @@
+A general approach to online network optimization problems
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+On-line generalized Steiner problem
@@ Property / cites work: On-line generalized Steiner problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542533
@@ Property / cites work: Q4542533 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating min-sum             <i>k</i>             -clustering in metric spaces
+Normal rank
@@ Property / cites work @@
+Q4527000
@@ Property / cites work: Q4527000 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Directed Steiner Problems
+Normal rank
@@ Property / cites work @@
+Q4542528
@@ Property / cites work: Q4542528 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579405
@@ Property / cites work: Q3579405 / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy approximation algorithm for the group Steiner problem
+Normal rank
@@ Property / cites work @@
+Q2934722
@@ Property / cites work: Q2934722 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation
+Normal rank
@@ Property / cites work @@
+On network design problems: fixed cost flows and the covering steiner problem
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for directed Steiner forest
+Normal rank
@@ Property / cites work @@
+Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Dial a Ride from k-Forest
@@ Property / cites work: Dial a Ride from k-Forest / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934710
@@ Property / cites work: Q2934710 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
+Normal rank
@@ Property / cites work @@
+Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
+Normal rank
@@ Property / cites work @@
+Polylogarithmic inapproximability
@@ Property / cites work: Polylogarithmic inapproximability / rank @@
+Normal rank
@@ Property / cites work @@
+An improved rounding method and semidefinite programming relaxation for graph partition
+Normal rank
@@ Property / cites work @@
+Maximum Gradient Embeddings and Monotone Clustering
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Matching Based Augmentations for Approximating Connectivity Problems
+Normal rank
@@ Property / cites work @@
+Q4694752
@@ Property / cites work: Q4694752 / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter Bounds for Graph Steiner Tree Approximation
+Normal rank
@@ Property / cites work @@
+Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing
+Normal rank
@@ Property / cites work @@
+Q2934723
@@ Property / cites work: Q2934723 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Analysis of the Greedy Algorithm for Set Cover
+Normal rank
@@ Property / cites work @@
+Q2768349
@@ Property / cites work: Q2768349 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828915
@@ Property / cites work: Q4828915 / rank @@
+Normal rank