The directed circular arrangement problem

DOI10.1145/1798596.1798600MaRDI QIDQ2930327zbMATH OpenOpenAlexFDO

Authors Joseph (Seffi) Naor, Roy Schwartz

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

region growingschedulingspreading metrics

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Recommendations

• The directed circular arrangement problem
• scientific article; zbMATH DE number 2086694
• Circular arrangements and cyclic broadcast scheduling
• STACS 2004
• New Approximation Techniques for Some Linear Ordering Problems

Cited in

(6)

• On tight spans for directed distances
• Divide-and-conquer approximation algorithms via spreading metrics
• Circular arrangements and cyclic broadcast scheduling
• scientific article; zbMATH DE number 2086694 (Why is no real title available?)
• STACS 2004
• The directed circular arrangement problem

This page was built for publication: The directed circular arrangement problem

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