Minimum d-dimensional arrangement with fixed points

DOI10.1137/1.9781611973402.125zbMath1421.68226arXiv1307.6627OpenAlexW4210916373MaRDI QIDQ5384087

Anastasios Sidiropoulos, Anupam Gupta

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.6627

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: Minimum d-dimensional arrangement with fixed points