On the approximability of digraph ordering

DOI10.1007/978-3-662-48350-3_66MaRDI QIDQ6828510zbMATH OpenFDO

Authors Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket

Publication date 19 November 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48350-3_66

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: On the approximability of digraph ordering

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