Temporal network optimization subject to connectivity constraints

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

Volumn 7966 LNCS, Issue PART 2, 2013, Pages 657-668

  Mertzios, George B ^a   Michail, Othon ^b   Chatzigiannakis, Ioannis ^b   Spirakis, Paul G ^b,c  

^a DURHAM UNIVERSITY   (United Kingdom)

^b University of Patras and Computer Technology Institute   (Greece)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTIVITY CONSTRAINTS; COST MINIMIZATION; DIRECTED ACYCLIC GRAPH (DAG); LOWER AND UPPER BOUNDS; MENGER'S THEOREM; NATURAL NUMBER; TEMPORAL NETWORKS; UNDERLYING GRAPHS;

ALGORITHMS; COMMUNICATION SYSTEMS; COSTS; GRAPH THEORY; OPTIMIZATION;

AUTOMATA THEORY;

EID: 84880293006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39212-2_57     Document Type: Conference Paper

References (17)

1. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Distributed Computing, pp. 235-253 (March 2006)
2. Avin, C., Koucký, M., Lotker, Z.: How to explore a fast-changing world (Cover time of a simple random walk on evolving graphs). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121-132. Springer, Heidelberg (2008)
3. Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger's theorem. Networks 28(3), 125-134 (1996)
4. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. IJPEDS 27(5), 387-408 (2012)
5. Creignou, N., Khanna, S., Sudan, M.: Complexity classifications of boolean constraint satisfaction problems. SIAM Monographs on Discrete Mathematics and Applications (2001)
6. Clementi, A.E., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: Proc. of the 27th ACM Symp. on Principles of Distributed Computing (PODC), pp. 213-222 (2008)
7. Fleischer, L., Tardos, É.: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters 23(3), 71-80 (1998)
8. Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. In: Proc. of the 12th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Philadelphia, PA, USA, pp. 210-219 (2001)
9. Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 504-513 (2000)
10. Katz, M., Katz, N.A., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. SIAM Journal on Computing 34(1), 23-40 (2004)
11. Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), pp. 513-522. ACM, New York (2010)
12. Khanna, S., Motwani, R., Sudan, M., Vazirani, U.: On syntactic versus computational views of approximability. SIAM Journal on Computing 28(1), 64-191 (1999)
13. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Mediated population protocols. Theoretical Computer Science 412(22), 2434-2450 (2011)
14. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: New Models for Population Protocols. In: Lynch, N.A. (ed.) Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool (2011)
15. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Causality, influence, and computation in possibly disconnected synchronous dynamic networks. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) OPODIS 2012. LNCS, vol. 7702, pp. 269-283. Springer, Heidelberg (2012)
16. Scheideler, C.: Models and techniques for communication in dynamic networks. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 27-49. Springer, Heidelberg (2002)
17. Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science 14(02), 267-285 (2003)