{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:15Z","timestamp":1753893795370,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Consider the problem of finding a large induced acyclic subgraph of a given simple digraph $D=(V,E)$. The decision version of this problem is $NP$-complete and its optimization is not likely to be approximable within a ratio of $O(n^{\\epsilon})$ for some $\\epsilon&gt;0$. We study this problem when $D$ is a random instance. We show that, almost surely, any maximal solution is within an $o(\\ln n)$ factor from the optimal one. In addition, except when $D$ is very sparse (having $n^{1+o(1)}$ edges), this ratio is in fact $O(1)$. Thus, the optimal solution can be approximated in a much better way over random instances.<\/jats:p>","DOI":"10.37236\/1739","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:02:44Z","timestamp":1578639764000},"source":"Crossref","is-referenced-by-count":3,"title":["Finding Induced Acyclic Subgraphs in Random Digraphs"],"prefix":"10.37236","volume":"10","author":[{"given":"C. R.","family":"Subramanian","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2003,12,4]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1r46\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1r46\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:05:25Z","timestamp":1579323925000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v10i1r46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12,4]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2003,1,6]]}},"URL":"https:\/\/doi.org\/10.37236\/1739","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2003,12,4]]},"article-number":"R46"}}