{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T04:16:05Z","timestamp":1743653765797,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311031"},{"type":"electronic","value":"9783642311048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_21","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"243-253","source":"Crossref","is-referenced-by-count":2,"title":["Improved Approximation for Orienting Mixed Graphs"],"prefix":"10.1007","author":[{"given":"Iftah","family":"Gamzu","sequence":"first","affiliation":[]},{"given":"Moti","family":"Medina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Afek, Y., Bremler-Barr, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago J. Theor. Comput. Sci. (1998)"},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1137\/S009753979223277X","volume":"23","author":"Y. Afek","year":"1994","unstructured":"Afek, Y., Gafni, E.: Distributed algorithms for unidirectional networks. SIAM J. Comput.\u00a023(6), 1152\u20131178 (1994)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0166-218X(01)00228-1","volume":"116","author":"E.M. Arkin","year":"2002","unstructured":"Arkin, E.M., Hassin, R.: A note on orientations of mixed graphs. Discrete Applied Mathematics\u00a0116(3), 271\u2013278 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-19754-3_12","volume-title":"Theory and Practice of Algorithms in (Computer) Systems","author":"B. Dorn","year":"2011","unstructured":"Dorn, B., H\u00fcffner, F., Kr\u00fcger, D., Niedermeier, R., Uhlmann, J.: Exploiting Bounded Signal Flow for Graph Orientation Based on Cause\u2013Effect Pairs. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol.\u00a06595, pp. 104\u2013115. Springer, Heidelberg (2011)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/15427951.2011.604554","volume":"7","author":"M. Elberfeld","year":"2011","unstructured":"Elberfeld, M., Bafna, V., Gamzu, I., Medvedovsky, A., Segev, D., Silverbush, D., Zwick, U., Sharan, R.: On the approximability of reachability-preserving network orientations. Internet Mathematics\u00a07, 209\u2013232 (2011)","journal-title":"Internet Mathematics"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-21458-5_35","volume-title":"Combinatorial Pattern Matching","author":"M. Elberfeld","year":"2011","unstructured":"Elberfeld, M., Segev, D., Davidson, C.R., Silverbush, D., Sharan, R.: Approximation Algorithms for Orienting Mixed Graphs. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 416\u2013428. Springer, Heidelberg (2011)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Feige, U., Goemans, M.X.: Aproximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In: 3rd ISTCS, pp. 182\u2013189 (1995)","DOI":"10.1109\/ISTCS.1995.377033"},{"issue":"21","key":"21_CR8","doi-asserted-by":"publisher","first-page":"5391","DOI":"10.1111\/j.1742-4658.2005.04973.x","volume":"272","author":"S. Fields","year":"2005","unstructured":"Fields, S.: High-throughput two-hybrid analysis: The promise and the peril. The FEBS Journal\u00a0272(21), 5391\u20135399 (2005)","journal-title":"The FEBS Journal"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-642-14165-2_49","volume-title":"Automata, Languages and Programming","author":"I. Gamzu","year":"2010","unstructured":"Gamzu, I., Segev, D.: A Sublogarithmic Approximation for Highway and Tollbooth Pricing. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 582\u2013593. Springer, Heidelberg (2010)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-15294-8_18","volume-title":"Algorithms in Bioinformatics","author":"I. Gamzu","year":"2010","unstructured":"Gamzu, I., Segev, D., Sharan, R.: Improved Orientations of Physical Networks. In: Moulton, V., Singh, M. (eds.) WABI 2010. LNCS, vol.\u00a06293, pp. 215\u2013225. Springer, Heidelberg (2010)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1038\/415141a","volume":"415","author":"A.C. Gavin","year":"2002","unstructured":"Gavin, A.C., Bosche, M., Krause, R., Grandi, P., Marzioch, M., Bauer, A., Schultz, J., Rick, J.M., Michon, A.M., Cruciat, C.M., Remor, M., Hofert, C., Schelder, M., Brajenovic, M., Ruffner, H., Merino, A., Klein, K., Hudak, M., Dickson, D., Rudi, T., Gnau, V., Bauch, A., Bastuck, S., Huhse, B., Leutwein, C., Heurtier, M.A., Copley, R.R., Edelmann, A., Querfurth, E., Rybin, V., Drewes, G., Raida, M., Bouwmeester, T., Bork, P., Seraphin, B., Kuster, B., Neubauer, G., Superti-Furga, G.: Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature\u00a0415, 141\u2013147 (2002)","journal-title":"Nature"},{"issue":"5","key":"21_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(97)00129-4","volume":"63","author":"S. Louis Hakimi","year":"1997","unstructured":"Louis Hakimi, S., Schmeichel, E.F., Young, N.E.: Orienting graphs to optimize reachability. IPL\u00a063(5), 229\u2013235 (1997)","journal-title":"IPL"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-47867-1_6","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Lewin","year":"2002","unstructured":"Lewin, M., Livnat, D., Zwick, U.: Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 67\u201382. Springer, Heidelberg (2002)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Marina, M.K., Das, S.R.: Routing performance in the presence of unidirectional links in multihop wireless networks. In: 3rd MobiHoc, pp. 12\u201323 (2002)","DOI":"10.1145\/513801.513803"},{"key":"21_CR15","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-87361-7_19","volume-title":"Algorithms in Bioinformatics","author":"A. Medvedovsky","year":"2008","unstructured":"Medvedovsky, A., Bafna, V., Zwick, U., Sharan, R.: An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 222\u2013232. Springer, Heidelberg (2008)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-20036-6_39","volume-title":"Research in Computational Molecular Biology","author":"D. Silverbush","year":"2011","unstructured":"Silverbush, D., Elberfeld, M., Sharan, R.: Optimally Orienting Physical Networks. In: Bafna, V., Sahinalp, S.C. (eds.) RECOMB 2011. LNCS, vol.\u00a06577, pp. 424\u2013436. Springer, Heidelberg (2011)"},{"issue":"2\/3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1089\/1066527041410382","volume":"11","author":"C.H. Yeang","year":"2004","unstructured":"Yeang, C.H., Ideker, T., Jaakkola, T.: Physical network models. Journal of Computational Biology\u00a011(2\/3), 243\u2013262 (2004)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T14:49:09Z","timestamp":1743605349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}