On generalizations of network design problems with degree bounds

This publication has 29 references indexed in Scilit:

• Tight Hardness Results for Minimizing Discrepancy
  2011
• A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
  Mathematics of Operations Research, 2010
• On Generalizations of Network Design Problems with Degree Bounds
  Lecture Notes in Computer Science, 2010
• Additive Guarantees for Degree-Bounded Directed Network Design
  SIAM Journal on Computing, 2010
• A push–relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
  Theoretical Computer Science, 2009
• What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs
  Algorithmica, 2007
• On the Crossing Spanning Tree Problem
  Lecture Notes in Computer Science, 2004
• Local Search Heuristics for k-Median and Facility Location Problems
  SIAM Journal on Computing, 2004
• A Constant-Factor Approximation Algorithm for the k-Median Problem
  Journal of Computer and System Sciences, 2002
• The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
  Journal of Computer and System Sciences, 1997