{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:54Z","timestamp":1725544914457},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422259"},{"type":"electronic","value":"9783540455356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45535-3_11","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T14:39:51Z","timestamp":1265899191000},"page":"130-144","source":"Crossref","is-referenced-by-count":0,"title":["Combined Connectivity Augmentation and Orientation Problems"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,21]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","volume":"28","author":"A. Frank","year":"1980","unstructured":"Frank, A.: On the orientation of graphs. J. Combinatorial Theory B 28No. 3 (1980) 251\u2013261","journal-title":"J. Combinatorial Theory B"},{"key":"11_CR2","unstructured":"Frank, A.: Connectivity augmentation problems in network design. In: Birge, J.R., Murty, K.G. (eds.): Mathematical Programming: State of the Art. Univ. of Michigan (1994) 34\u201363"},{"key":"11_CR3","first-page":"111","volume":"113","author":"A. Frank","year":"1996","unstructured":"Frank, A.: Orientations of graphs and submodular flows. Congressus Numerantium 113 (1996) 111\u2013142","journal-title":"Congressus Numerantium"},{"key":"11_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-48777-8_15","volume-title":"Parity constrained k-edge-connected orientations","author":"A. Frank","year":"1999","unstructured":"Frank, A., Kir\u00e1ly, Z.: Parity constrained k-edge-connected orientations. In: Cornuejols, G., Burkard, R., Woeginger, G.J. (eds.): Lecture Notes in Computer Science, Vol. 1610. Springer-Verlag, Berlin Heidelberg New York (1999) 191\u2013201"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02592217","volume":"29","author":"S. Fujishige","year":"1984","unstructured":"Fujishige, S.: Structures of polyhedra determined by submodular functions on crossing families. Mathematical Programming 29 (1984) 125\u2013141","journal-title":"Mathematical Programming"},{"key":"11_CR6","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercices. North-Holland (1979)"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","volume":"3","author":"W. Mader","year":"1982","unstructured":"Mader, W.: Konstruktion aller n-fach kantenzusammenh\u00e4ngenden Digraphen. Europ. J. Combinatorics 3 (1982) 63\u201367","journal-title":"Europ. J. Combinatorics"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","volume":"12","author":"C.St.J.A. Nash-Williams","year":"1960","unstructured":"Nash-Williams, C.St.J.A.: On orientations, connectivity and odd vertex pairings infinite graphs. Canad. J. Math. 12 (1960) 555\u2013567","journal-title":"Canad. J. Math."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W.T. Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J.London Math. Soc. 36 (1961) 221\u2013230","journal-title":"J.London Math. Soc."},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"W. T","year":"1987","unstructured":"Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. Computer and System Sciences 35No. 1 (1987) 96\u2013144","journal-title":"Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45535-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T11:02:32Z","timestamp":1551006152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45535-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422259","9783540455356"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45535-3_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}