Wiretapping a hidden network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5929 LNCS, Issue , 2009, Pages 438-446

  Aziz, Haris ^b   Lachish, Oded ^a   Paterson, Mike ^a   Savani, Rahul ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF MUNICH   (Germany)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Network security; Nucleolus; Wiretapping; Zero sum game

Indexed keywords

BEST RESPONSE; COMMUNICATION NETWORKS; CONNECTIVITY GAMES; EQUILIBRIUM STRATEGY; EXTREME POINTS; MAX-MIN; NUCLEOLUS; POLYNOMIAL-TIME ALGORITHMS; POLYTOPES; SINGLE LINK; SUCCINT REPRESENTATION; UNDERLYING GRAPHS; VIRTUAL NETWORKS; ZERO-SUM GAME;

INTERNET; WINE;

NETWORK SECURITY;

EID: 76649137674     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10841-9_40     Document Type: Conference Paper

References (12)

1. Aziz, H., Lachish, O., Paterson, M., Savani, R.: Power indices in spanning connectivity games. In: AAIM: Algorithmic Aspects in Information and Management, pp. 55-67 (2009)
2. Aziz, H., Lachish, O., Paterson, M., Savani, R.: Wiretapping a hidden network. Technical report (2009), http://arxiv.org/abs/0909.5293
3. Chakrabarty, D., Mehta, A., Vazirani, V.V.: Design is as easy as optimization. In: ICALP: International Colloquium on Automata, Languages and Programming, pp. 477-488 (2006)
4. Cunningham, W.H.: Optimal attack and reinforcement of a network. J. ACM 32(3), 549-561 (1985)
5. Fujishige, S.: Submodular Functions and Optimization. Annals of Discrete Mathematics, vol. 58. Elsevier, Amsterdam (2005)
6. Gusfield, D.: Connectivity and edge-disjoint spanning trees. Inf. Process. Lett. 16(2), 87-89 (1983)
7. Narayanan, H.: Theory of matroids and network analysis. PhD thesis, IIT, Bombay (1974)
8. Nash-Williams, C.S.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 445-450 (1961)
9. Patkar, S., Narayanan, H.: Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition. In: FST TCS: Foundations of Software Technology and Theoretical Computer Science, pp. 94-105. Springer, Heidelberg (2000)
10. Potters, J.A.M., Tijs, S.H.: The nucleolus of a matrix game and other nucleoli. Math. Oper. Res. 17(1), 164-174 (1992)
11. Tomizawa, N.: Strongly irreducible matroids and principal partition of a matroid into strongly irreducible minors. Electron. and Commun. 59(A), 1-10 (1976)
12. Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 36, 221-230 (1961)