l22 spreading metrics for vertex ordering problems

DOI10.1145/1109557.1109670zbMath1192.68875OpenAlexW4255878127MaRDI QIDQ3581516

No author found.

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109670

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Efficient reassembling of graphs. I: The linear case ⋮ An improved approximation ratio for the minimum linear arrangement problem ⋮ Low-light trees, and tight lower bounds for Euclidean spanners ⋮ Unnamed Item

This page was built for publication: l²₂ spreading metrics for vertex ordering problems