{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:21Z","timestamp":1740122361865,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T00:00:00Z","timestamp":1207267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s10878-008-9150-4","type":"journal-article","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T17:12:01Z","timestamp":1207242721000},"page":"402-423","source":"Crossref","is-referenced-by-count":5,"title":["Packing trees in communication networks"],"prefix":"10.1007","volume":"16","author":[{"given":"Mohamed","family":"Saad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Vannelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,4]]},"reference":[{"key":"9150_CR1","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1137\/S1052623497318013","volume":"9","author":"KM Anstreicher","year":"1999","unstructured":"Anstreicher KM (1999) Towards a practical volumetric cutting plane method for convex programming. SIAM J Optim 9:190\u2013206","journal-title":"SIAM J Optim"},{"key":"9150_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S, Lund C, Motwani R, Sudan M, Szegedy M (1998) Proof verification and hardness of approximation problems. J Assoc Comput Mach 45:501\u2013555","journal-title":"J Assoc Comput Mach"},{"unstructured":"Arora S, Hazan E, Kale S (2008) Multiplicative weights method: a meta-algorithm and its applications. Manuscript. Available at http:\/\/www.cs.princeton.edu\/~arora\/pubs\/MWsurvey.pdf","key":"9150_CR3"},{"issue":"1","key":"9150_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01196262","volume":"1","author":"B Awerbuch","year":"1995","unstructured":"Awerbuch B, Azar Y (1995) Competitive multicast routing. Wirel Netw 1(1):107\u2013114","journal-title":"Wirel Netw"},{"key":"9150_CR5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1051\/ro:2004028","volume":"38","author":"A Baltz","year":"2004","unstructured":"Baltz A, Srivastav A (2004) Fast approximation of minimum multicast congestion\u2014implementation versus theory. RAIRO Oper Res 38:319\u2013344","journal-title":"RAIRO Oper Res"},{"key":"9150_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M Bern","year":"1989","unstructured":"Bern M, Plassmann P (1989) The Steiner problem with edge lengths 1 and 2. Inf Process Lett 32:171\u2013176","journal-title":"Inf Process Lett"},{"doi-asserted-by":"crossref","unstructured":"Bienstock D, Iyengar G (2004) Solving fractional packing problems in O *(1\/\u03b5) iterations. In: Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), pp 146\u2013155","key":"9150_CR7","DOI":"10.1145\/1007352.1007382"},{"key":"9150_CR8","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s00453-003-1054-1","volume":"38","author":"M Cai","year":"2004","unstructured":"Cai M, Deng X, Wang L (2004) Minimum k arborescences with bandwidth constraints. Algorithmica 38:529\u2013537","journal-title":"Algorithmica"},{"key":"9150_CR9","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/11533719_16","volume-title":"Proceedings of the 11th international computing and combinatorics conference (COCOON 2005)","author":"Z Cai","year":"2005","unstructured":"Cai Z, Lin G, Xue GL (2005) Improved approximation algorithms for the capacitated multicast routing problem. In: Proceedings of the 11th international computing and combinatorics conference (COCOON 2005). LNCS, vol 3595. Springer, Berlin, pp 136\u2013145"},{"unstructured":"Carr R, Vempala S (2000) Randomized meta-rounding. In: Proceedings of the 32nd ACM symposium on the theory of computing (STOC 2000), pp 58\u201362","key":"9150_CR10"},{"doi-asserted-by":"crossref","unstructured":"Charikar M, Chekuri C, Goel A, Guha S, Plotkin S (1998) Approximating a finite metric by a small number of tree metrics. In: Proceedings of the 39th annual IEEE symposium on foundations of computer science (FOCS 1998), pp 379\u2013388","key":"9150_CR11","DOI":"10.1109\/SFCS.1998.743488"},{"issue":"3","key":"9150_CR12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/90.851977","volume":"8","author":"S Chen","year":"2000","unstructured":"Chen S, G\u00fcnl\u00fck O, Yener B (2000) The multicast packing problem. IEEE\/ACM Trans Netw 8(3):311\u2013318","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9150_CR13","series-title":"LNCS","first-page":"180","volume-title":"Proceedings of the 12th annual European symposium on algorithms (ESA 2004)","author":"J Cheriyan","year":"2004","unstructured":"Cheriyan J, Salavatipour M (2004) Hardness and approximation results for packing Steiner trees problems. In: Proceedings of the 12th annual European symposium on algorithms (ESA 2004). LNCS, vol 3221. Springer, Berlin, pp 180\u2013191"},{"key":"9150_CR14","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-45471-3_18","volume-title":"Proceedings of the 8th Scandinavian workshop on algorithm theory (SWAT 2002)","author":"M Chleb\u00edk","year":"2002","unstructured":"Chleb\u00edk M, Chleb\u00edkov\u00e1 J (2002) Approximation hardness of the Steiner tree problem. In: Proceedings of the 8th Scandinavian workshop on algorithm theory (SWAT 2002). LNCS, vol 2368. Springer, Berlin, pp 170\u2013179"},{"issue":"4","key":"9150_CR15","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.jpdc.2005.10.010","volume":"66","author":"J Chleb\u00edkov\u00e1","year":"2006","unstructured":"Chleb\u00edkov\u00e1 J, Ye D, Zhang H (2006) Assign ranges in general ad-hoc networks. J Parall Distrib Comput 66(4):489\u2013498","journal-title":"J Parall Distrib Comput"},{"issue":"1\u20133","key":"9150_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.tcs.2007.02.064","volume":"377","author":"F Diedrich","year":"2007","unstructured":"Diedrich F, Jansen K (2007) Faster and simpler approximation algorithms for mixed packing and covering problems. Theor Comput Sci 377(1\u20133):181\u2013204","journal-title":"Theor Comput Sci"},{"issue":"4","key":"9150_CR17","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/S0895480199355754","volume":"13","author":"L Fleischer","year":"2000","unstructured":"Fleischer L (2000) Approximating fractional multicommodity flow independent of the number of commodities. SIAM J Discrete Math 13(4):505\u2013520","journal-title":"SIAM J Discrete Math"},{"doi-asserted-by":"crossref","unstructured":"Garg N, K\u00f6nemann J (1998) Fast and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of the 39th IEEE annual symposium on foundations of computer science (FOCS 1998), pp 300\u2013309","key":"9150_CR18","DOI":"10.1109\/SFCS.1998.743463"},{"key":"9150_CR19","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/0804004","volume":"4","author":"MD Grigoriadis","year":"1994","unstructured":"Grigoriadis MD, Khachiyan LG (1994) Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J Optim 4:86\u2013107","journal-title":"SIAM J Optim"},{"key":"9150_CR20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"2","author":"MD Grigoriadis","year":"1996","unstructured":"Grigoriadis MD, Khachiyan LG (1996) Coordination complexity of parallel price-directive decomposition. Math Oper Res 2:321\u2013340","journal-title":"Math Oper Res"},{"key":"9150_CR21","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1:169\u2013197","journal-title":"Combinatorica"},{"key":"9150_CR22","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02592086","volume":"72","author":"M Gr\u00f6tschel","year":"1996","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1996a) Packing Steiner trees: a cutting plane algorithm and computational results. Math Program 72:125\u2013145","journal-title":"Math Program"},{"key":"9150_CR23","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1137\/S0895480193258716","volume":"9","author":"M Gr\u00f6tschel","year":"1996","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1996b) Packing Steiner trees: separation algorithms. SIAM J Discrete Math 9:233\u2013257","journal-title":"SIAM J Discrete Math"},{"key":"9150_CR24","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02614374","volume":"78","author":"M Gr\u00f6tschel","year":"1997","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1997) The Steiner tree packing problem in VLSI-design. Math Program 78:265\u2013281","journal-title":"Math Program"},{"key":"9150_CR25","series-title":"LNCS","first-page":"320","volume-title":"Proceedings of the 1st international conference on algorithmic applications in management (AAIM 2005)","author":"X-D Hu","year":"2005","unstructured":"Hu X-D, Shuai T (2005) Wavelength assignment for satisfying maximal number of requests in all-optical networks. In: Proceedings of the 1st international conference on algorithmic applications in management (AAIM 2005). LNCS, vol 3521. Springer, Berlin, pp 320\u2013329"},{"doi-asserted-by":"crossref","unstructured":"Hu X-D, Jia X, Shuai T, Zhang M-H (2004) Multicast routing and wavelength assignment in WDM networks with limited drop-offs. In: Proceedings of the 23rd annual joint conference of the IEEE computer and communications societies (INFOCOM 2004)","key":"9150_CR26","DOI":"10.1109\/INFCOM.2004.1354520"},{"unstructured":"Jain K, Mahdian M, Salavatipour MR (2003) Packing Steiner trees. In: Proceedings of the 14th ACM-SIAM symposium on discrete algorithms (SODA 2003), pp 266\u2013274","key":"9150_CR27"},{"key":"9150_CR28","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/030601570","volume":"17","author":"K Jansen","year":"2006","unstructured":"Jansen K (2006) Approximation algorithm for the mixed fractional packing and covering problem. SIAM J Optim 17:331\u2013352","journal-title":"SIAM J Optim"},{"doi-asserted-by":"crossref","unstructured":"Jansen K, Zhang H (2008) Approximation algorithms for general packing problems and their application to the multicast congestion problem. Math Program, to appear. Available at http:\/\/dx.doi.org\/10.1007\/s10107-007-0106-8","key":"9150_CR29","DOI":"10.1007\/s10107-007-0106-8"},{"key":"9150_CR30","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0305-0548(00)00066-6","volume":"29","author":"GW Jeong","year":"2002","unstructured":"Jeong GW, Lee K, Park S, Park K (2002) A branch-and-price algorithm for the Steiner tree packing problem. Comput Oper Res 29:221\u2013241","journal-title":"Comput Oper Res"},{"key":"9150_CR31","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/S0140-3664(97)00081-9","volume":"20","author":"X Jia","year":"1997","unstructured":"Jia X, Wang L (1997) A group multicast routing algorithm by using multiple minimum Steiner trees. Comput Commun 20:750\u2013758","journal-title":"Comput Commun"},{"issue":"1","key":"9150_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipl.2004.03.006","volume":"91","author":"P Kaski","year":"2004","unstructured":"Kaski P (2004) Packing Steiner trees with identical terminal sets. Inf Process Lett 91(1):1\u20135","journal-title":"Inf Process Lett"},{"unstructured":"Khandekar R (2004) Lagrangian relaxation based algorithms for convex programming problems. PhD thesis, Indian Institute of Technology Delhi","key":"9150_CR33"},{"unstructured":"Lau LC (2004) An approximate max-Steiner-tree-packing min-Steiner-cut theorem. In: Proceedings of the 45th IEEE symposium on foundations of computer science (FOCS 2004), pp 61\u201370","key":"9150_CR34"},{"key":"9150_CR35","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/11496915_27","volume-title":"Proceedings of the 11th conference on integer programming and combinatorial optimization (IPCO 2005)","author":"LC Lau","year":"2005","unstructured":"Lau LC (2005) Packing Steiner forests. In: Proceedings of the 11th conference on integer programming and combinatorial optimization (IPCO 2005). LNCS, vol 3509. Springer, Berlin, pp 362\u2013376"},{"issue":"3","key":"9150_CR36","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10878-005-1776-x","volume":"9","author":"G Lin","year":"2005","unstructured":"Lin G (2005) An improved approximation algorithm for multicast k-tree routing. J Comb Optim 9(3):349\u2013356","journal-title":"J Comb Optim"},{"key":"9150_CR37","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/11427186_15","volume-title":"Proceedings of the 4th international workshop on efficient and experimental algorithms (WEA 2005)","author":"Q Lu","year":"2005","unstructured":"Lu Q, Zhang H (2005) Implementation of approximation algorithms for the multicast congestion problem. In: Proceedings of the 4th international workshop on efficient and experimental algorithms (WEA 2005). LNCS, vol 3503. Springer, Berlin, pp 152\u2013164"},{"key":"9150_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1999.1661","volume":"60","author":"B Ma","year":"2000","unstructured":"Ma B, Wang L (2000) On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints. J Comput Syst Sci 60:1\u201312","journal-title":"J Comput Syst Sci"},{"key":"9150_CR39","first-page":"185","volume":"6","author":"A Martin","year":"1993","unstructured":"Martin A, Weismantel R (1993) Packing paths and Steiner trees: routing of electronic circuits. CWI Q 6:185\u2013204","journal-title":"CWI Q"},{"key":"9150_CR40","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"2","author":"SA Plotkin","year":"1995","unstructured":"Plotkin SA, Shmoys DB, Tardos E (1995) Fast approximation algorithms for fractional packing and covering problems. Math Oper Res 2:257\u2013301","journal-title":"Math Oper Res"},{"key":"9150_CR41","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P Raghavan","year":"1988","unstructured":"Raghavan P (1988) Probabilistic construction of deterministic algorithms: approximating packing integer programs. J Comput Syst Sci 37:130\u2013143","journal-title":"J Comput Syst Sci"},{"doi-asserted-by":"crossref","unstructured":"Pulleyblank WR (1995) Two Steiner tree packing problems. In: Proceedings of the 27th annual ACM symposium on theory of computing (STOC 1995), pp 383\u2013387","key":"9150_CR42","DOI":"10.1145\/225058.225163"},{"issue":"4","key":"9150_CR43","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"Raghavan P, Thompson CD (1987) Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4):365\u2013374","journal-title":"Combinatorica"},{"unstructured":"Robins G, Zelikovsky A (2000) Improved Steiner tree approximation in graphs. In: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms (SODA 2000), pp 770\u2013779","key":"9150_CR44"},{"unstructured":"Saad M, Terlaky T, Vannelli A, Zhang H (2005) A provably good global routing algorithm in multilayer IC and MCM layout designs. Technical report, AdvOL #2005-15, Advanced Optimization Lab., McMaster University, Hamilton, ON, Canada. http:\/\/www.cas.mcmaster.ca\/~oplab\/research.htm","key":"9150_CR45"},{"doi-asserted-by":"crossref","unstructured":"Sanders P, Egner S, Tolhuizen L (2003) Polynomial time algorithms for network information flow. In: Proceedings of the 15th annual ACM symposium on parallel algorithms and architectures (SPAA 2003), pp 286\u2013294","key":"9150_CR46","DOI":"10.1145\/777412.777464"},{"key":"9150_CR47","series-title":"LNCS","first-page":"1051","volume-title":"Proceedings of the 16th annual international symposium on algorithms and computation (ISAAC 2005)","author":"T Terlaky","year":"2005","unstructured":"Terlaky T, Vannelli A, Zhang H (2005) On routing in VLSI design and communication networks. In: Proceedings of the 16th annual international symposium on algorithms and computation (ISAAC 2005). LNCS, vol 3827. Springer, Berlin, pp 1051\u20131060"},{"issue":"2","key":"9150_CR48","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/43.68406","volume":"10","author":"A Vannelli","year":"1991","unstructured":"Vannelli A (1991) An adaptation of the interior point method for solving the global routing problem. IEEE Trans Comput Aided Des 10(2):193\u2013203","journal-title":"IEEE Trans Comput Aided Des"},{"key":"9150_CR49","series-title":"LNCS","first-page":"367","volume-title":"Proceedings of the 10th international symposium on algorithms and computation (ISAAC 1999)","author":"S Vempala","year":"1999","unstructured":"Vempala S, V\u00f6cking B (1999) Approximating multicast congestion. In: Proceedings of the 10th international symposium on algorithms and computation (ISAAC 1999). LNCS, vol 1741. Springer, Berlin, pp 367\u2013372"},{"key":"9150_CR50","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-642-99789-1_25","volume-title":"Applied mathematics and parallel computing\u2014festschrift for Klaus Ritter","author":"J Villavicencio","year":"1996","unstructured":"Villavicencio J, Grigoriadis MD (1996) Approximate structured optimization by cyclic block-coordinate descent. In: Fischer H, Riedm\u00fcller B, Sch\u00e4ffler S (eds) Applied mathematics and parallel computing\u2014festschrift for Klaus Ritter. Physica-Verlag, Heidelberg, pp 359\u2013371"},{"key":"9150_CR51","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/978-3-642-59179-2_23","volume-title":"Network optimization","author":"J Villavicencio","year":"1997","unstructured":"Villavicencio J, Grigoriadis MD (1997) Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos P, Hearn DW, Hager WW (eds) Network optimization. Lecture notes in economics and mathematical systems, vol 450. Springer, Berlin, pp 471\u2013485"},{"key":"9150_CR52","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-540-25960-2_24","volume-title":"Proceedings of the 10th international conference on integer programming and combinatorial optimization (IPCO 2004)","author":"J Vygen","year":"2004","unstructured":"Vygen J (2004) Near-optimum global routing with coupling, delay bounds, and power consumption. In: Proceedings of the 10th international conference on integer programming and combinatorial optimization (IPCO 2004). LNCS, vol 3064. Springer, Berlin, pp 308\u2013324"},{"key":"9150_CR53","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(00)00092-7","volume":"29","author":"C-F Wang","year":"2002","unstructured":"Wang C-F, Liang C-T, Jan R-H (2002) Heuristic algorithms for packing multiple-group multicasting. Comput Oper Res 29:905\u2013924","journal-title":"Comput Oper Res"},{"key":"9150_CR54","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-540-27796-5_26","volume-title":"Proceedings of the 11th colloquium on structural information and communication complexity (Sirocco 2004)","author":"D Ye","year":"2004","unstructured":"Ye D, Zhang H (2004) The range assignment problem in static ad-hoc networks on metric spaces. In: Proceedings of the 11th colloquium on structural information and communication complexity (Sirocco 2004). LNCS, vol 3104. Springer, Berlin, pp 291\u2013302"},{"unstructured":"Young NE (1995) Randomized rounding without solving the linear program. In: Proceedings of the 6th ACM-SIAM symposium on discrete algorithms (SODA 1995), pp 170\u2013178","key":"9150_CR55"},{"doi-asserted-by":"crossref","unstructured":"Young NE (2001) Sequential and parallel algorithms for mixed packing and covering. In: Proceedings of the 42nd annual symposium on foundations of computer science (FOCS 2001), pp 538\u2013546","key":"9150_CR56","DOI":"10.1109\/SFCS.2001.959930"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9150-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9150-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9150-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,3]],"date-time":"2020-05-03T19:24:48Z","timestamp":1588533888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9150-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,4]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["9150"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9150-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2008,4,4]]}}}