The following pages link to (Q4542533):
Displaying 50 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Online network design with outliers (Q334928) (← links)
- Optimal random matchings, tours, and spanning trees in hierarchically separated trees (Q388460) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Sampling, denoising and compression of matrices by coherent matrix organization (Q448484) (← links)
- On the efficiency of routing in sensor networks (Q455964) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← 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)
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- Approximating snowflake metrics by trees (Q723016) (← links)
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- Center-based clustering under perturbation stability (Q763489) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- A randomized algorithm for the on-line weighted bipartite matching problem (Q835627) (← links)
- Enhanced negative type for finite metric trees (Q924649) (← links)
- On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Random martingales and localization of maximal inequalities (Q982510) (← links)
- Semi-preemptive routing on trees (Q1003476) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Randomized algorithm for the \(k\)-server problem on decomposable spaces (Q1044025) (← links)
- Non-approximability of weighted multiple sequence alignment. (Q1401267) (← links)
- Low dimensional embeddings of ultrametrics. (Q1422397) (← links)
- Minimum restricted diameter spanning trees. (Q1427810) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Low complexity variants of the arrow distributed directory (Q1604202) (← links)
- Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions (Q1669061) (← links)
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
- The mixed Lipschitz space and its dual for tree metrics (Q1742818) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- New results for online page replication (Q1887086) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- Minimizing energies with hierarchical costs (Q1931618) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← 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)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Discrete and continuous models for partitioning problems (Q2254249) (← links)
- Online and offline algorithms for the sorting buffers problem on the line metric (Q2266935) (← 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)
