scientific article; zbMATH DE number 1775400
From MaRDI portal
Publication:4542533
Recommendations
Cited in
(only showing first 100 items - show all)- Piecewise integrable neural network: an interpretable chaos identification framework
- Approximation algorithms for general one-warehouse multi-retailer systems
- A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case
- On-line generalized Steiner problem
- Semi-preemptive routing on trees
- On fixed cost k-flow problems
- Steiner shallow-light trees are exponentially lighter than spanning ones
- Low-light trees, and tight lower bounds for Euclidean spanners
- A randomized algorithm for the on-line weighted bipartite matching problem
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Reconstructing approximate tree metrics
- Approximating \(k\)-hop minimum-spanning trees
- Covering Metric Spaces by Few Trees
- A tight bound on approximating arbitrary metrics by tree metrics
- Minimizing energies with hierarchical costs
- A constant-factor approximation algorithm for the k-median problem
- The mixed Lipschitz space and its dual for tree metrics
- Minimum weakly fundamental cycle bases are hard to find
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
- Local embeddings of metric spaces
- Minimum restricted diameter spanning trees.
- Oblivious buy-at-bulk in planar graphs
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Approximating snowflake metrics by trees
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- New approximation algorithms for the unsplittable capacitated facility location problem
- Stochastic approximation of lamplighter metrics
- On the \(p\)-median polytope of \(Y\)-free graphs
- Using petal-decompositions to build a low stretch spanning tree
- Collective additive tree spanners for circle graphs and polygonal graphs
- Additive Spanners for Circle Graphs and Polygonal Graphs
- Approximability of unsplittable shortest path routing problems
- Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
- A poly-log competitive posted-price algorithm for online metrical matching on a spider
- Improved lower bound for differentially private facility location
- The \(k\)-server problem
- Low complexity variants of the arrow distributed directory
- A randomized on–line algorithm for the k–server problem on a line
- Multifacility ordered median problems on networks: A further analysis
- Lossless prioritized embeddings
- Subexponential parameterized algorithms for graphs of polynomial growth
- Pathwidth, trees, and random embeddings
- Some results on metric trees
- A tight bound on approximating arbitrary metrics by tree metrics
- On the efficiency of routing in sensor networks
- Tree metrics and edge-disjoint \(S\)-paths
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
- Advances in metric embedding theory
- Satisfying general proximity/similarity queries with metric trees
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions
- On dominated \(\ell_1\) metrics
- Reliable Spanners for Metric Spaces
- An improved upper bound for the universal TSP on the grid
- Center-based clustering under perturbation stability
- Online network design with outliers
- The \(k\)-centrum multi-facility location problem
- Online and offline algorithms for the sorting buffers problem on the line metric
- The polymatroid Steiner problems
- A greedy approximation algorithm for the group Steiner problem
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- Deterministic 3-server on a circle and the limitation of canonical potentials
- Maximum gradient embeddings and monotone clustering
- Covering metric spaces by few trees
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees
- Local search algorithms for the red-blue median problem
- The agreement metric for labeled binary trees
- A primal-dual online algorithm for the k-server problem on weighted HSTs
- Randomized algorithm for the \(k\)-server problem on decomposable spaces
- Enhanced negative type for finite metric trees
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- On the hardness of full Steiner tree problems
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Non-approximability of weighted multiple sequence alignment.
- Survey on oblivious routing strategies
- On the intercluster distance of a tree metric
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- A general decomposition theorem for the k-server problem
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
- Approximating fault-tolerant group-Steiner problems
- Low dimensional embeddings of ultrametrics.
- Random martingales and localization of maximal inequalities
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Online facility location with deletions
- On approximating planar metrics by tree metrics.
- Recognition of Tree Metrics
- Quasimetric embeddings and their applications
- New results for online page replication
- Approximation algorithms for the covering Steiner problem
- Light graphs with small routing cost
- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
- On notions of distortion and an almost minimum spanning tree with constant average distortion
- Optimal lower bounds for universal and differentially private Steiner trees and TSPs
- New length bounds for cycle bases
- Discrete and continuous models for partitioning problems
- Optimal random matchings, tours, and spanning trees in hierarchically separated trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542533)
