Pages that link to "Item:Q5917578"

The following pages link to A tight bound on approximating arbitrary metrics by tree metrics (Q5917578):

Displaying 50 items.

• On fixed cost \(k\)-flow problems (Q260248) (← links)
• On approximating tree spanners that are breadth first search trees (Q269500) (← links)
• Online network design with outliers (Q334928) (← links)
• Metric embedding, hyperbolic space, and social networks (Q340518) (← links)
• Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
• A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
• The \(k\)-server problem (Q458484) (← links)
• A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
• On the hardness of full Steiner tree problems (Q491161) (← links)
• Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
• Online computation with advice (Q541670) (← links)
• Deterministic sampling algorithms for network design (Q547282) (← links)
• \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
• Dynamic vs. oblivious routing in network design (Q634684) (← links)
• A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
• Spanners in sparse graphs (Q657919) (← links)
• Local search algorithms for the red-blue median problem (Q692631) (← links)
• Bayesian ignorance (Q714780) (← links)
• Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
• A randomized algorithm for the on-line weighted bipartite matching problem (Q835627) (← links)
• Approximation algorithms for requirement cut on graphs (Q848961) (← links)
• Algorithms for the universal and a priori TSP (Q924875) (← links)
• On average distortion of embedding metrics into the line (Q938313) (← links)
• Random martingales and localization of maximal inequalities (Q982510) (← links)
• Randomly removing \(g\) handles at once (Q991176) (← links)
• An improved approximation algorithm for requirement cut (Q991474) (← links)
• Ramsey partitions and proximity data structures (Q997827) (← links)
• Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
• A note on the subadditive network design problem (Q1038103) (← links)
• Non-approximability of weighted multiple sequence alignment for arbitrary metrics (Q1041795) (← links)
• Randomized algorithm for the \(k\)-server problem on decomposable spaces (Q1044025) (← links)
• Metric decompositions of path-separable graphs (Q1679219) (← links)
• Tree spanners of bounded degree graphs (Q1693164) (← links)
• UPGMA and the normalized equidistant minimum evolution problem (Q1704587) (← links)
• Virtual machine placement for minimizing connection cost in data center networks (Q1751257) (← links)
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem (Q1932671) (← links)
• An introduction to the Ribe program (Q1936714) (← links)
• Improved approximation for fractionally subadditive network design (Q2011025) (← links)
• A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
• The minimum degree group Steiner problem (Q2065790) (← links)
• On approximating degree-bounded network design problems (Q2134742) (← links)
• A poly-log competitive posted-price algorithm for online metrical matching on a spider (Q2140487) (← links)
• Covering metric spaces by few trees (Q2168848) (← links)
• Group parking permit problems (Q2184679) (← links)
• Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
• Discrete and continuous models for partitioning problems (Q2254249) (← links)
• Distributed transactional memory for general networks (Q2256963) (← links)
• A simple algorithm for the multiway cut problem (Q2294387) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• On notions of distortion and an almost minimum spanning tree with constant average distortion (Q2316932) (← links)