Temporal Network Optimization Subject to Connectivity Constraints
Open Access
- 5 July 2018
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 81 (4) , 1416-1449
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Engineering and Physical Sciences Research Council (EP/P020372/1)
- “ARISTEIA”, European Union and Greek National Resources (Foundations of Dynamic Distributed Computing Systems (FOCUS))
- MULTIPLEX - Future Emerging Technologies - European Union (317532)
- Engineering and Physical Sciences Research Council (EP/K022660/1, EP/P02002X/1)
This publication has 28 references indexed in Scilit:
- On the Complexity of Information Spreading in Dynamic Networks2013
- Time-varying graphs and dynamic networksInternational Journal of Parallel, Emergent and Distributed Systems, 2012
- Flooding time in edge-Markovian dynamic graphs2008
- Computation in networks of passively mobile finite-state sensorsDistributed Computing, 2006
- Complexity Classifications of Boolean Constraint Satisfaction Problems2001
- Efficient continuous-time dynamic network flow algorithmsOperations Research Letters, 1998
- Modern Graph Theory1998
- Hardness of approximating problems on cubic graphs1997
- Vulnerability of scheduled networks and a generalization of Menger's TheoremNetworks, 1996
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987