{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T21:51:46Z","timestamp":1769982706137,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540767954","type":"print"},{"value":"9783540767961","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76796-1_6","type":"book-chapter","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T07:24:04Z","timestamp":1225956244000},"page":"87-126","source":"Crossref","is-referenced-by-count":8,"title":["A Survey on Covering Supermodular Functions"],"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","reference":[{"key":"6_CR1","series-title":"Bolyai Society Mathematical Studies","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-540-85221-6_4","volume-title":"Building Bridges Between Mathematics and Computer Science","author":"K. B\u00e9rczi","year":"2008","unstructured":"B\u00e9rczi, K., Frank, A.: Variations for Lov\u00e1sz\u2019 submodular ideas. In: Gr\u00f6tschel, M., Katona, G.O.H. (eds.) Building Bridges Between Mathematics and Computer Science. Bolyai Society Mathematical Studies, vol.\u00a019, pp. 137\u2013164. Springer, Berlin (2008)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0012-365X(03)00229-2","volume":"273","author":"A. Berg","year":"2003","unstructured":"Berg, A., Jackson, B., Jord\u00e1n, T.: Edge splitting and connectivity augmentation in directed hypergraphs. Discrete Math. 273, 71\u201384 (2003)","journal-title":"Discrete Math."},{"key":"6_CR3","unstructured":"Bern\u00e1th, A., Kir\u00e1ly, T.: Covering symmetric skew-supermodular functions with hyperedges. EGRES Technical Report No. 2008-05 (2008)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0167-6377(97)00032-1","volume":"21","author":"D. Bertsimas","year":"1997","unstructured":"Bertsimas, D., Teo, C.: The parsimonious property of cut covering problems and its applications. Oper. Res. Lett. 21, 123\u2013132 (1997)","journal-title":"Oper. Res. Lett."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/jgt.3190070213","volume":"7","author":"M.-c. Cai","year":"1983","unstructured":"Cai, M.-c.: Arc-disjoint arborescences of digraphs. J.\u00a0Graph Theory 7, 235\u2013240 (1983)","journal-title":"J.\u00a0Graph Theory"},{"key":"6_CR6","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1998)"},{"key":"6_CR7","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 69\u201387. Gordon and Breach, New York (1970)"},{"key":"6_CR8","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J.: Edge-disjoint branchings. In: Rustin, B. (ed.) Combinatorial Algorithms, pp. 91\u201396. Academic Press, New York (1973)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185\u2013204 (1977)","journal-title":"Ann. Discrete Math."},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5(4), 653\u2013665 (1976)","journal-title":"SIAM J. Comput."},{"key":"6_CR11","series-title":"Colloquia Mathematica Societatis Janos Bolyai","first-page":"159","volume-title":"Algebraic Methods in Graph Theory","author":"A. Frank","year":"1978","unstructured":"Frank, A.: On disjoint trees and arborescences. In: Algebraic Methods in Graph Theory. Colloquia Mathematica Societatis Janos Bolyai, vol. 25, pp. 159\u2013169. North-Holland, Amsterdam (1978)"},{"key":"6_CR12","first-page":"63","volume":"41","author":"A. Frank","year":"1979","unstructured":"Frank, A.: Kernel systems of directed graphs. Acta Sci. Math. 41, 63\u201376 (1979)","journal-title":"Acta Sci. Math."},{"issue":"3","key":"6_CR13","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. Comb. Theory, Ser. B 28(3), 251\u2013261 (1980)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"6_CR14","series-title":"Colloquia Mathematica Societatis Janos Bolyai","first-page":"285","volume-title":"Finite and Infinite Sets","author":"A. Frank","year":"1981","unstructured":"Frank, A.: Generalized polymatroids. In: Finite and Infinite Sets, Eger, 1981. Colloquia Mathematica Societatis Janos Bolyai, vol. 37, pp. 285\u2013294. North-Holland, Amsterdam (1981)"},{"key":"6_CR15","first-page":"97","volume":"16","author":"A. Frank","year":"1982","unstructured":"Frank, A.: An algorithm for submodular functions on graphs. Ann. Discrete Math. 16, 97\u2013120 (1982)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Math. 5(1), 22\u201353 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR17","series-title":"London Mathematical Society Lecture Note Series","first-page":"85","volume-title":"Surveys in Combinatorics","author":"A. Frank","year":"1993","unstructured":"Frank, A.: Applications of submodular functions. In: Walker, K. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 187, pp. 85\u2013136. Cambridge University Press, Cambridge (1993)"},{"key":"6_CR18","first-page":"34","volume-title":"Mathematical Programming: State of the Art","author":"A. Frank","year":"1994","unstructured":"Frank, A.: Connectivity augmentation problems in network design. In: Birge, J.R., Murty, K.G. (eds.) Mathematical Programming: State of the Art, pp. 34\u201363. The University of Michigan Press, Ann Arbor (1994)"},{"key":"6_CR19","first-page":"111","volume":"113","author":"A. Frank","year":"1996","unstructured":"Frank, A.: Orientations of graphs and submodular flows. Congr. Numer. 113, 111\u2013142 (1996)","journal-title":"Congr. Numer."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0166-218X(02)00461-4","volume":"131","author":"A. Frank","year":"2003","unstructured":"Frank, A.: Restricted t-matchings in bipartite graphs. Discrete Appl. Math. 131, 337\u2013346 (2003)","journal-title":"Discrete Appl. Math."},{"key":"6_CR21","series-title":"Bolyai Society Mathematical Studies","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-540-32439-3_6","volume-title":"More Sets, Graphs and Numbers","author":"A. Frank","year":"2006","unstructured":"Frank, A.: Edge-connection of graphs, digraphs, and hypergraphs. In: More Sets, Graphs and Numbers. Bolyai Society Mathematical Studies, vol. 15, pp. 93\u2013141. Springer, Berlin (2006)"},{"key":"6_CR22","unstructured":"Frank, A.: Rooted k-connections in digraphs. Discrete Appl. Math. (2008), to appear"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jctb.1995.1044","volume":"65","author":"A. Frank","year":"1995","unstructured":"Frank, A., Jord\u00e1n, T.: Minimal edge-coverings of pairs of sets. J. Comb. Theory 65(1), 73\u2013110 (1995)","journal-title":"J. Comb. Theory"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0166-218X(02)00460-2","volume":"131","author":"A. Frank","year":"2003","unstructured":"Frank, A., Kir\u00e1ly, T.: Combined connectivity augmentation and orientation problems. Discrete Appl. Math. 131, 401\u2013419 (2003)","journal-title":"Discrete Appl. Math."},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BF01589418","volume":"42","author":"A. Frank","year":"1988","unstructured":"Frank, A., Tardos, \u00c9.: Generalized polymatroids and submodular flows. Math. Program., Ser. B 42, 489\u2013563 (1988)","journal-title":"Math. Program., Ser. B"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0024-3795(89)90469-2","volume":"114\/115","author":"A. Frank","year":"1989","unstructured":"Frank, A., Tardos, \u00c9.: An application of submodular flows. Linear Algebra Appl. 114\/115, 329\u2013348 (1989)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S0895480195287723","volume":"10","author":"A. Frank","year":"1997","unstructured":"Frank, A., Karzanov, A.V., Seb\u0151, A.: On integer multiflow maximization. SIAM J. Discrete Math. 10(1), 158\u2013170 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(01)00213-X","volume":"115","author":"A. Frank","year":"2001","unstructured":"Frank, A., Jord\u00e1n, T., Szigeti, Z.: An orientation theorem with parity conditions. Discrete Appl. Math. 115, 37\u201345 (2001)","journal-title":"Discrete Appl. Math."},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0166-218X(02)00462-6","volume":"131","author":"A. Frank","year":"2003","unstructured":"Frank, A., Kir\u00e1ly, T., Kir\u00e1ly, Z.: On the orientation of graphs and hypergraphs. Discrete Appl. Math. 131, 385\u2013400 (2003a)","journal-title":"Discrete Appl. Math."},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0166-218X(02)00463-8","volume":"131","author":"A. Frank","year":"2003","unstructured":"Frank, A., Kir\u00e1ly, T., Kriesell, M.: On decomposing a hypergraph into k connected sub-hypergraphs. Discrete Appl. Math. 131, 373\u2013383 (2003b)","journal-title":"Discrete Appl. Math."},{"key":"6_CR31","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. Math. Program. 29, 125\u2013141 (1984)","journal-title":"Math. Program."},{"key":"6_CR32","series-title":"Ann. Discrete Math.","volume-title":"Submodular Functions and Optimization","author":"S. Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization, 2nd edn., Ann. Discrete Math., vol. 58, Elsevier, Amsterdam (2005)","edition":"2"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01580607","volume":"60","author":"M.X. Goemans","year":"1993","unstructured":"Goemans, M.X., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60, 145\u2013166 (1993)","journal-title":"Math. Program."},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(84)90039-X","volume":"37","author":"E. Gy\u0151ri","year":"1984","unstructured":"Gy\u0151ri, E.: A minmax theorem on intervals. J. Comb. Theory, Ser. B 37, 1\u20139 (1984)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"6_CR35","unstructured":"Kamiyama, N., Katoh, N., Takizawa, A.: Arc-disjoint in-trees in directed graphs. In: Proc. Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 518\u2013526 (2008)"},{"key":"6_CR36","first-page":"59","volume-title":"Mathematical Programming","author":"A.V. Karzanov","year":"1978","unstructured":"Karzanov, A.V., Lomonosov, M.V.: Systems of flows in undirected networks. In: Larychev, O.I. (ed.) Mathematical Programming, vol.\u00a01, pp. 59\u201366. Institute for System Studies, Moscow (1978) (in Russian)"},{"issue":"1","key":"6_CR37","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/S0895480100380112","volume":"19","author":"S. Khanna","year":"2005","unstructured":"Khanna, S., Naor, J., Shepherd, F.B.: Directed network design with orientation constraints. SIAM J. Discrete Math. 19(1), 245\u2013257 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.jctb.2003.12.004","volume":"91","author":"T. Kir\u00e1ly","year":"2004","unstructured":"Kir\u00e1ly, T.: Covering symmetric supermodular functions by uniform hypergraphs. J. Comb. Theory, Ser. B 91, 185\u2013200 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"6_CR39","unstructured":"Kir\u00e1ly, T.: Merging hyperedges to meet edge-connectivity requirements. EGRES Technical Report No.\u00a02005-08. Hungarian version: Mat. Lapok 13(1), 28\u201331 (2007a)"},{"key":"6_CR40","unstructured":"Kir\u00e1ly, T.: Applications of Eulerian splitting-off. EGRES Technical Report No. 2007-01. In: Proceedings of Hungarian\u2013Japanese Symposium on Discrete Mathematics and its Applications, pp. 298\u2013307 (2007b)"},{"key":"6_CR41","unstructured":"Kir\u00e1ly, T., Makai, M.: A note on hypergraph connectivity augmentation. EGRES Technical Report No. 2002-11. Hungarian version: Mat. Lapok 13(1), pp. 32\u201339 (2007)"},{"key":"6_CR42","unstructured":"Kir\u00e1ly, T., Szab\u00f3, J.: A note on parity constrained orientations. Combinatorica, to appear"},{"key":"6_CR43","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2008","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Algorithms and Combinatorics, vol. 21, Springer, Berlin (2008)","edition":"4"},{"key":"6_CR44","first-page":"289","volume":"17","author":"M. Lorea","year":"1975","unstructured":"Lorea, M.: Hypergraphes et matroides. Cahiers Centre Etud. Rech. Oper. 17, 289\u2013291 (1975)","journal-title":"Cahiers Centre Etud. Rech. Oper."},{"key":"6_CR45","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF01894789","volume":"21","author":"L. Lov\u00e1sz","year":"1970","unstructured":"Lov\u00e1sz, L.: A generalization of K\u0151nig\u2019s theorem. Acta Math. Acad. Sci. Hungar. 21, 443\u2013446 (1970)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"6_CR46","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L. Lov\u00e1sz","year":"1976","unstructured":"Lov\u00e1sz, L.: On some connectivity properties of Eulerian graphs. Acta Math. Acad. Sci. Hungar. 28, 129\u2013138 (1976)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"6_CR47","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)"},{"issue":"2","key":"6_CR48","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C.L. Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Younger, D.H.: A minmax relation for directed graphs. J. Lond. Math. Soc. 17(2), 369\u2013374 (1978)","journal-title":"J. Lond. Math. Soc."},{"key":"6_CR49","unstructured":"Makai, M., Szab\u00f3, J.: The parity problem of polymatroids without double circuits. Combinatorica, to appear"},{"key":"6_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-540-72792-7_14","volume-title":"Proc. IPCO XII","author":"M. Makai","year":"2007","unstructured":"Makai, M., Pap, Gy., Szab\u00f3, J.: Matching problems in polymatroids without double circuits. In: Fischetti, M., Williamson, D.P. (eds.) Proc. IPCO XII. Lecture Notes in Computer Science, vol. 4513, pp. 167\u2013181. Springer, Berlin (2007)"},{"key":"6_CR51","series-title":"Monographs on Discrete Mathematics and Applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718508","volume-title":"Discrete Convex Analysis","author":"K. Murota","year":"2003","unstructured":"Murota, K.: Discrete Convex Analysis. Monographs on Discrete Mathematics and Applications, vol. 10, SIAM, Philadelphia (2003)"},{"key":"6_CR52","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C.St.J.A. Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.St.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39, 12 (1964)","journal-title":"J. Lond. Math. Soc."},{"issue":"106","key":"6_CR53","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","volume":"31","author":"L. Nebesk\u00fd","year":"1981","unstructured":"Nebesk\u00fd, L.: A new characterization of the maximum genus of a graph. Czechoslov. Math. J. 31(106), 604\u2013613 (1981)","journal-title":"Czechoslov. Math. J."},{"issue":"2","key":"6_CR54","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/qmath\/os-13.1.83","volume":"13","author":"R. Rado","year":"1942","unstructured":"Rado, R.: A theorem on independence relations. Q.J. Math. 13(2), 83\u201389 (1942)","journal-title":"Q.J. Math."},{"key":"6_CR55","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/B978-0-12-566780-7.50025-8","volume-title":"Progress in Combinatorial Optimization","author":"A. Schrijver","year":"1984","unstructured":"Schrijver, A.: Total dual integrality from directed graphs, crossing families and sub- and supermodular functions. In: Pulleyblank, W.R. (ed.) Progress in Combinatorial Optimization, pp. 315\u2013362. Academic Press, New York (1984)"},{"key":"6_CR56","series-title":"Colloquia Mathematica Societatis J\u00e1nos Bolyai","first-page":"327","volume-title":"Matroid Theory","author":"A. Schrijver","year":"1985","unstructured":"Schrijver, A.: Supermodular colourings. In: Matroid Theory, Szeged, 1982. Colloquia Mathematica Societatis J\u00e1nos Bolyai, vol. 40, pp. 327\u2013343. North-Holland, Amsterdam (1985)"},{"key":"6_CR57","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0095-8956(91)90052-L","volume":"53","author":"A. Schrijver","year":"1991","unstructured":"Schrijver, A.: Short proofs on multicommodity flows and cuts. J. Comb. Theory, Ser. B 53, 32\u201339 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"6_CR58","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24, Springer, Berlin (2003)"},{"issue":"1\u20133","key":"6_CR59","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0012-365X(00)00381-2","volume":"234","author":"L. Szeg\u0151","year":"2001","unstructured":"Szeg\u0151, L.: A note on covering intersecting set-systems by digraphs. Discrete Math. 234(1\u20133), 187\u2013189 (2001)","journal-title":"Discrete Math."},{"issue":"3","key":"6_CR60","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s101070050036","volume":"84","author":"Z. Szigeti","year":"1999","unstructured":"Szigeti, Z.: Hypergraph connectivity augmentation. Math. Program., Ser. B 84(3), 519\u2013527 (1999)","journal-title":"Math. Program., Ser. B"},{"key":"6_CR61","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0012-365X(78)90174-7","volume":"24","author":"K. Vidyasankar","year":"1978","unstructured":"Vidyasankar, K.: Covering the edge-set of a directed graph with trees. Discrete Math. 24, 79\u201385 (1978)","journal-title":"Discrete Math."}],"container-title":["Research Trends in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76796-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T01:05:37Z","timestamp":1632099937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76796-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540767954","9783540767961"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76796-1_6","relation":{},"subject":[]}}