{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:21:08Z","timestamp":1762251668397},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642171963"},{"type":"electronic","value":"9783642171970"}],"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-17197-0_1","type":"book-chapter","created":{"date-parts":[[2010,11,22]],"date-time":"2010-11-22T10:35:06Z","timestamp":1290422106000},"page":"1-20","source":"Crossref","is-referenced-by-count":31,"title":["Design of Network Topology in an Adversarial Environment"],"prefix":"10.1007","author":[{"given":"Assane","family":"Gueye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean C.","family":"Walrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkat","family":"Anantharam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Richa, A., Scheideler, C.: A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks. In: PODC 2008: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 45\u201354 (2008)","key":"1_CR1","DOI":"10.1145\/1400751.1400759"},{"key":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (March 2004)"},{"issue":"5","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.disc.2007.11.056","volume":"309","author":"P.A. Catlin","year":"2009","unstructured":"Catlin, P.A., Lai, H.-J., Shao, Y.: Edge-Connectivity and Edge-Disjoint Spanning Trees. Discrete Mathematics\u00a0309(5), 1033\u20131040 (2009)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0167-6377(89)90029-1","volume":"8","author":"S. Chopra","year":"1989","unstructured":"Chopra, S.: On the Spanning Tree Polyhedron. Operations Research Letters\u00a08(1), 25\u201329 (1989)","journal-title":"Operations Research Letters"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10878-007-9071-7","volume":"14","author":"C.W. Commander","year":"2007","unstructured":"Commander, C.W., Pardalos, P.M., Ryabchenko, V., Uryasev, S., Zrazhevsky, G.: The Wireless Network Jamming Problem. J. Comb. Optim.\u00a014(4), 481\u2013498 (2007)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(91)90364-8","volume":"89","author":"R. Cordovil","year":"1991","unstructured":"Cordovil, R., Fukuda, K., Moreira, M.L.: Clutters and Matroids. Discrete Math.\u00a089(2), 161\u2013171 (1991)","journal-title":"Discrete Math."},{"key":"1_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717105","volume-title":"Combinatorial Optimization: Packing and Covering","author":"G. Cornuejols","year":"2001","unstructured":"Cornuejols, G.: Combinatorial Optimization: Packing and Covering. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2001)"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W.H. Cunningham","year":"1985","unstructured":"Cunningham, W.H.: Optimal Attack and Reinforcement of a Network. J. ACM\u00a032(3), 549\u2013561 (1985)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Edmonds, J., Fulkerson, D.R.: Bottleneck Extrema. Journal of Combinatorial Theory\u00a0(8), 299\u2013306 (1970)","key":"1_CR9","DOI":"10.1016\/S0021-9800(70)80083-7"},{"doi-asserted-by":"crossref","unstructured":"Fulkerson, D.R.: Blocking and Anti-Blocking Pairs of Polyhedra. Math. Programming\u00a0(1), 168\u2013194 (1971)","key":"1_CR10","DOI":"10.1007\/BF01584085"},{"doi-asserted-by":"crossref","unstructured":"Gueye, A., Walrand, J.C., Anantharam, V.: Understanding the Design of Network Topology in Adversarial Environment (2010), http:\/\/www.eecs.berkeley.edu\/~agueye\/index.html","key":"1_CR11","DOI":"10.1007\/978-3-642-17197-0_1"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1236457.1236458","volume":"54","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., Kumar, A., Pal, M., Roughgarden, T.: Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. J. ACM\u00a054(3), 11 (2007)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Connectivity and Edge-Disjoint Spanning Trees. Information Processing Letters\u00a0(16), 87\u201389 (1983)","key":"1_CR13","DOI":"10.1016\/0020-0190(83)90031-5"},{"doi-asserted-by":"crossref","unstructured":"Karger, D.R., Stein, C.: An o(n2) Algorithm for Minimum Cuts, New York, NY, USA, pp. 757\u2013765 (1993)","key":"1_CR14","DOI":"10.1145\/167088.167281"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. Kruskal","year":"1956","unstructured":"Kruskal, J., Joseph, B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society\u00a07(1), 48\u201350 (1956)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"1_CR16","first-page":"453","volume-title":"Flows in Networks","author":"D. Fulkerson","year":"1962","unstructured":"Fulkerson, D., Ford, L.: Flows in Networks, pp. 453\u2013460. Princeton Univ. Press, Princeton (1962)"},{"unstructured":"Matveev, A.O.: Maps on Posets, and Blockers. ArXiv Mathematics e-prints (November 2004)","key":"1_CR17"},{"doi-asserted-by":"crossref","unstructured":"Matveev, A.O.: On Blockers in Bounded Posets. Int. J. Math. Math. Sci.\u00a0(26), 581\u2013588","key":"1_CR18","DOI":"10.1155\/S0161171201020087"},{"doi-asserted-by":"crossref","unstructured":"Nash-Williams, J.A.: Edge-Disjoint Spanning Trees of Finite Graphs. Journal London Math. Soc.\u00a0(36), 445\u2013450 (1961)","key":"1_CR19","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest Connection Networks and some Generalizations. Bell System Technology Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technology Journal"},{"key":"1_CR21","volume-title":"Linear Programming: Foundations and Extensions","author":"V. Robert","year":"2001","unstructured":"Robert, V.: Linear Programming: Foundations and Extensions. Springer, Heidelberg (2001)"},{"issue":"4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM\u00a044(4), 585\u2013591 (1997)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: On the Problem of Decomposing a Graph into N Connected Factors. Journal of the London Mathematical Society\u00a0(36), 221\u2013230 (1961)","key":"1_CR23","DOI":"10.1112\/jlms\/s1-36.1.221"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J.v. Neumann","year":"1928","unstructured":"Neumann, J.v.: Zur Theorie der Gesellschaftspiele. Mathematische Annalen\u00a0100, 295\u2013320 (1928)","journal-title":"Mathematische Annalen"},{"key":"1_CR25","volume-title":"Matroid Theory","author":"D. Welsh","year":"1976","unstructured":"Welsh, D.: Matroid Theory. Academic Press, New York (1976)"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17197-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T09:01:28Z","timestamp":1559811688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17197-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171963","9783642171970"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17197-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}