{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:00:56Z","timestamp":1758265256289},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_7","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"74-85","source":"Crossref","is-referenced-by-count":10,"title":["Approximating Transitive Reductions for Directed Networks"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhaskar","family":"DasGupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A. Aho","year":"1972","unstructured":"Aho, A., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM Journal of Computing\u00a01(2), 131\u2013137 (1972)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00453-007-9055-0","volume":"51","author":"R. Albert","year":"2008","unstructured":"Albert, R., DasGupta, B., Dondi, R., Sontag, E.: Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. Algorithmica\u00a051(2), 129\u2013159 (2008)","journal-title":"Algorithmica"},{"issue":"7","key":"7_CR3","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1089\/cmb.2007.0015","volume":"14","author":"R. Albert","year":"2007","unstructured":"Albert, R., DasGupta, B., Dondi, R., Kachalo, S., Sontag, E., Zelikovsky, A., Westbrooks, K.: A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. Journal of Computational Biology\u00a014(7), 927\u2013949 (2007)","journal-title":"Journal of Computational Biology"},{"key":"7_CR4","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation Hardness of Short Symmetric Instances of MAX-3SAT, Electronic Colloquium on Computational Complexity, Report TR03-049 (2003), \n                  \n                    http:\/\/eccc.hpi-web.de\/eccc-reports\/2003\/TR03-049\/index.html"},{"key":"7_CR5","unstructured":"Dubois, V., Bothorel, C.: Transitive reduction for social network analysis and visualization. In: IEEE\/WIC\/ACM International Conference on Web Intelligence, pp. 128\u2013131 (2005)"},{"key":"7_CR6","unstructured":"Edmonds, J.: Optimum Branchings. In: Dantzig, G.B., Veinott Jr., A.F. (eds.) Mathematics and the Decision Sciences. Amer. Math. Soc. Lectures Appl. Math., vol.\u00a011, pp. 335\u2013345 (1968)"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G.N. Frederickson","year":"1981","unstructured":"Frederickson, G.N., J\u00e0J\u00e0, J.: Approximation algorithms for several graph augmentation problems. SIAM Journal of Computing\u00a010(2), 270\u2013283 (1981)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1093\/bioinformatics\/btm571","volume":"24","author":"S. Kachalo","year":"2008","unstructured":"Kachalo, S., Zhang, R., Sontag, E., Albert, R., DasGupta, B.: NET-SYNTHESIS: A software for synthesis, inference and simplification of signal transduction networks. Bioinformatics\u00a024(2), 293\u2013295 (2008)","journal-title":"Bioinformatics"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/net.3230010305","volume":"1","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: A simple derivation of Edmonds\u2019 algorithm for optimum branching. Networks\u00a01, 265\u2013272 (1972)","journal-title":"Networks"},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/S0097539793256685","volume":"24","author":"S. Khuller","year":"1995","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Approximating the minimum equivalent digraph. SIAM Journal of Computing\u00a024(4), 859\u2013872 (1995)","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0166-218X(95)00105-Z","volume":"69","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Young, N.: On strongly connected digraphs with bounded cycle length. Discrete Applied Mathematics\u00a069(3), 281\u2013289 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR12","unstructured":"Khuller, S., Raghavachari, B., Zhu, A.: A uniform framework for approximating weighted connectivity problems. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937\u2013938 (1999)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/321526.321534","volume":"16","author":"D.M. Moyles","year":"1969","unstructured":"Moyles, D.M., Thompson, G.L.: Finding a minimum equivalent of a digraph. JACM\u00a016(3), 455\u2013460 (1969)","journal-title":"JACM"},{"key":"7_CR14","first-page":"212","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity, p. 212. Addison-Wesley, Reading (1994)"},{"key":"7_CR15","unstructured":"Vetta, A.: Approximating the minimum strongly connected subgraph via a matching lower bound. In: 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 417\u2013426 (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T01:38:33Z","timestamp":1552095513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}