Optimal Embedding into Star Metrics (Q3183463)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Optimal Embedding into Star Metrics	scientific article

Statements

scholarly article

0 references

Optimal Embedding into Star Metrics (English)

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

20 October 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-03367-4_26

0 references

On a routing problem

0 references

Computing a minimum-dilation spanning tree is NP-hard

0 references

0 references

Metric spaces in pure and applied mathematics

0 references

0 references

Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete

0 references

0 references

Minimum dilation stars

0 references

0 references

0 references

A characterization of the minimum cycle mean in a digraph

0 references

Parametric shortest path algorithms with an application to cyclic staffing

0 references

Computing Geometric Minimum-Dilation Graphs Is NP-Hard

0 references

0 references

Combinatorial optimization with rational objective functions

0 references

Applying Parallel Computation Algorithms in the Design of Serial Algorithms

0 references

Towards a Genuinely Polynomial Algorithm for Linear Programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-03367-4_26

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3183463

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3183463&oldid=35132456"