{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T14:07:00Z","timestamp":1790518020438,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642152931","type":"print"},{"value":"9783642152948","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15294-8_18","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T08:51:46Z","timestamp":1284108706000},"page":"215-225","source":"Crossref","is-referenced-by-count":12,"title":["Improved Orientations of Physical Networks"],"prefix":"10.1007","author":[{"given":"Iftah","family":"Gamzu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danny","family":"Segev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roded","family":"Sharan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, Chichester (2000)","edition":"2"},{"issue":"3","key":"18_CR2","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":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-540-45198-3_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"G. Even","year":"2003","unstructured":"Even, G., Garg, N., K\u00f6nemann, J., Ravi, R., Sinha, A.: Covering graphs using trees and stars. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 24\u201335. Springer, Heidelberg (2003)"},{"key":"18_CR4","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: Proceedings 3rd Israel Symposium on Theory and Computing Systems, pp. 182\u2013189 (1995)","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-10003-2_73","volume-title":"Automata, Languages and Programming","author":"G.N. Frederickson","year":"1980","unstructured":"Frederickson, G.N., Johnson, D.B.: Generating and searching sets induced by networks. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 221\u2013233. Springer, Heidelberg (1980)"},{"key":"18_CR6","unstructured":"Gamzu, I., Segev, D.: A sublogarithmic approximation for highway and tollbooth pricing. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (to appear, 2010), http:\/\/arxiv.org\/abs\/1002.2084"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.10054","volume":"41","author":"O. Goldschmidt","year":"2003","unstructured":"Goldschmidt, O., Hochbaum, D.S., Levin, A., Olinick, E.V.: The SONET edge-partition problem. Networks\u00a041(1), 13\u201323 (2003)","journal-title":"Networks"},{"issue":"5","key":"18_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(97)00129-4","volume":"63","author":"S.L. Hakimi","year":"1997","unstructured":"Hakimi, S.L., Schmeichel, E.F., Young, N.E.: Orienting graphs to optimize reachability. Information Processing Letters\u00a063(5), 229\u2013235 (1997)","journal-title":"Information Processing Letters"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/1150334.1150341","volume":"2","author":"R. Hassin","year":"2006","unstructured":"Hassin, R., Segev, D.: Robust subgraphs for trees and paths. ACM Transactions on Algorithms\u00a02(2), 263\u2013281 (2006)","journal-title":"ACM Transactions on Algorithms"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. Journal of the ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"Journal of the ACM"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Kanehisa, M., Goto, S., Furumichi, M., Tanabe, M., Hirakawa, M.: KEGG for representation and analysis of molecular networks involving diseases and drugs. Nucleic Acids Research\u00a038(2), D355\u2013D360 (2010)","DOI":"10.1093\/nar\/gkp896"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S. Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM Journal on Computing\u00a037(1), 319\u2013357 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Lewin, M., Livnat, D., Zwick, U.: Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In: Proceedings 9th International Conference on Integer Programming and Combinatorial Optimization, pp. 67\u201382 (2002)","DOI":"10.1007\/3-540-47867-1_6"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Medvedovsky, A.: An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks. Master\u2019s thesis, Tel-Aviv University, Israel (2009)","DOI":"10.1007\/978-3-540-87361-7_19"},{"key":"18_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)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15294-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:49:48Z","timestamp":1740505788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}