scientific article; zbMATH DE number 1775400
From MaRDI portal
Publication:4542533
zbMath1029.68951MaRDI QIDQ4542533
Publication date: 1 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (90)
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering ⋮ A randomized algorithm for the on-line weighted bipartite matching problem ⋮ New results for online page replication ⋮ On-line generalized Steiner problem ⋮ Multifacility ordered median problems on networks: A further analysis ⋮ A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Light graphs with small routing cost ⋮ Approximation algorithms for the covering Steiner problem ⋮ New approximation algorithms for the unsplittable capacitated facility location problem ⋮ A poly-log competitive posted-price algorithm for online metrical matching on a spider ⋮ New length bounds for cycle bases ⋮ Additive Spanners for Circle Graphs and Polygonal Graphs ⋮ Approximation algorithms for general one-warehouse multi-retailer systems ⋮ Online network design with outliers ⋮ Covering metric spaces by few trees ⋮ Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions ⋮ Lossless Prioritized Embeddings ⋮ Prioritized Metric Structures and Embedding ⋮ A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs ⋮ Optimal random matchings, tours, and spanning trees in hierarchically separated trees ⋮ Minimizing energies with hierarchical costs ⋮ Stochastic approximation of lamplighter metrics ⋮ Reliable Spanners for Metric Spaces ⋮ Non-approximability of weighted multiple sequence alignment. ⋮ A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case ⋮ Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions ⋮ Maximum gradient embeddings and monotone clustering ⋮ \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees ⋮ Unnamed Item ⋮ Collective additive tree spanners for circle graphs and polygonal graphs ⋮ Pathwidth, trees, and random embeddings ⋮ Sampling, denoising and compression of matrices by coherent matrix organization ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Low dimensional embeddings of ultrametrics. ⋮ On the efficiency of routing in sensor networks ⋮ The \(k\)-server problem ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ Enhanced negative type for finite metric trees ⋮ Minimum restricted diameter spanning trees. ⋮ Using Petal-Decompositions to Build a Low Stretch Spanning Tree ⋮ A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching ⋮ Advances in metric embedding theory ⋮ On the hardness of full Steiner tree problems ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ The mixed Lipschitz space and its dual for tree metrics ⋮ On the \(p\)-median polytope of \(Y\)-free graphs ⋮ Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences ⋮ Survey on Oblivious Routing Strategies ⋮ Local search algorithms for the red-blue median problem ⋮ Discrete and continuous models for partitioning problems ⋮ The \(k\)-centrum multi-facility location problem ⋮ Approximating \(k\)-hop minimum-spanning trees ⋮ Low-light trees, and tight lower bounds for Euclidean spanners ⋮ On dominated \(\ell_1\) metrics ⋮ Online and offline algorithms for the sorting buffers problem on the line metric ⋮ A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design ⋮ Random martingales and localization of maximal inequalities ⋮ Approximability of unsplittable shortest path routing problems ⋮ Approximating snowflake metrics by trees ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph ⋮ Efficient distributed approximation algorithms via probabilistic tree embeddings ⋮ Semi-preemptive routing on trees ⋮ Quasimetric embeddings and their applications ⋮ Collective Additive Tree Spanners of Homogeneously Orderable Graphs ⋮ Oblivious Buy-at-Bulk in Planar Graphs ⋮ A node-capacitated Okamura-Seymour theorem ⋮ Local embeddings of metric spaces ⋮ The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme ⋮ Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees ⋮ Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs ⋮ Covering Metric Spaces by Few Trees ⋮ Minimum weakly fundamental cycle bases are hard to find ⋮ Center-based clustering under perturbation stability ⋮ Approximating fault-tolerant group-Steiner problems ⋮ A randomized on–line algorithm for the k–server problem on a line ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ On notions of distortion and an almost minimum spanning tree with constant average distortion ⋮ Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models ⋮ Subexponential parameterized algorithms for graphs of polynomial growth ⋮ Randomized algorithm for the \(k\)-server problem on decomposable spaces ⋮ Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones ⋮ The polymatroid Steiner problems ⋮ Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion ⋮ A general decomposition theorem for the \(k\)-server problem ⋮ A greedy approximation algorithm for the group Steiner problem ⋮ On approximating planar metrics by tree metrics. ⋮ Low complexity variants of the arrow distributed directory ⋮ A constant-factor approximation algorithm for the \(k\)-median problem ⋮ On fixed cost \(k\)-flow problems
This page was built for publication:
