Optimal Embedding into Star Metrics
From MaRDI portal
Recommendations
- On optimal embeddings of metrics in graphs
- An Optimality Criterion for Graph Embeddings of Metrics
- Improved algorithms for optimal embeddings
- scientific article; zbMATH DE number 2166920
- Metric embedding via shortest path decompositions
- Metric Embedding via Shortest Path Decompositions
- Approximation by Durrmeyer Type Exponential Sampling Operators
- scientific article; zbMATH DE number 2079367
- Path embedding in star graphs
- On optimal embeddings and trees
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3702681 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 1789916 (Why is no real title available?)
- scientific article; zbMATH DE number 1424297 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- A characterization of the minimum cycle mean in a digraph
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial optimization with rational objective functions
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard
- Computing a minimum-dilation spanning tree is NP-hard
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete
- Metric spaces in pure and applied mathematics
- Minimum dilation stars
- On a routing problem
- Parametric shortest path algorithms with an application to cyclic staffing
- Towards a Genuinely Polynomial Algorithm for Linear Programming
Cited in
(2)
This page was built for publication: Optimal Embedding into Star Metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183463)
