A divide and conquer algorithm for d-dimensional arrangement

zbMATH Open1302.68315MaRDI QIDQ2934636FDOQ2934636

Authors: Konstantin Makarychev, Yury Makarychev, Moses Charikar 

Publication date: 18 December 2014

Recommendations

• \(d\)-dimensional arrangement revisited
• Minimum Linear Arrangement of Series-Parallel Graphs
• Minimum \(d\)-dimensional arrangement with fixed points
• New Approximation Techniques for Some Linear Ordering Problems
• An improved approximation ratio for the minimum linear arrangement problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Cited In (4)

• Exact solution of the 2-dimensional grid arrangement problem
• \(d\)-dimensional arrangement revisited
• Minimum \(d\)-dimensional arrangement with fixed points
• Title not available (Why is that?)

This page was built for publication: A divide and conquer algorithm for \(d\)-dimensional arrangement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934636)