Temporal Flows in Temporal Networks
暂无分享,去创建一个
Paul G. Spirakis | Jurek Czyzowicz | Leszek Gasieniec | Eleni C. Akrida | Lukasz Kuszner | Leszek Gąsieniec | J. Czyzowicz | P. Spirakis | L. Kuszner | L. Gąsieniec
[1] Aleksander Madry,et al. Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[2] James B. Orlin,et al. Max flows in O(nm) time, or better , 2013, STOC '13.
[3] Alexandr Andoni,et al. Towards (1 + ∊)-Approximate Flow Sparsifiers , 2013, SODA.
[4] Boaz Patt-Shamir,et al. Near-Optimal Distributed Maximum Flow: Extended Abstract , 2015, PODC.
[5] Gerhard J. Woeginger,et al. One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs , 1998, Oper. Res. Lett..
[6] Paul G. Spirakis,et al. The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..
[7] Tomasz Radzik,et al. Faster algorithms for the generalized network flow problem , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[8] Naoyuki Kamiyama,et al. The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths , 2014, Discret. Appl. Math..
[9] Laurent Massoulié,et al. The diameter of opportunistic mobile networks , 2007, CoNEXT '07.
[10] Tomasz Radzik,et al. Minimizing capacity violations in a transshipment network , 1992, SODA '92.
[11] Martin Skutella,et al. An Introduction to Network Flows over Time , 2008, Bonn Workshop of Combinatorial Optimization.
[12] Paul G. Spirakis,et al. Temporal Network Optimization Subject to Connectivity Constraints , 2013, ICALP.
[13] Tomasz Radzik. Improving time bounds on maximum generalised flow computations by contracting the network , 2004, Theor. Comput. Sci..
[14] Paul G. Spirakis,et al. Ephemeral networks with random availability of links: The case of fast networks , 2016, J. Parallel Distributed Comput..
[15] Amit Kumar,et al. New Approximation Schemes for Unsplittable Flow on a Path , 2015, SODA.
[16] Khaled M. Elbassioni,et al. Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees , 2012, FSTTCS.
[17] Andreas Wiese,et al. Submodular unsplittable flow on trees , 2016, IPCO.
[18] Paul G. Spirakis,et al. Flows in Temporal networks , 2016, ArXiv.
[19] Cecilia Mascolo,et al. Graph Metrics for Temporal Networks , 2013, ArXiv.
[20] Yuval Rabani,et al. Allocating Bandwidth for Bursty Connections , 2000, SIAM J. Comput..
[21] Piotr Indyk. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 , 2015, SODA.
[22] Paul G. Spirakis,et al. On Temporally Connected Graphs of Small Cost , 2015, WAOA.
[23] Martin Skutella,et al. Quickest Flows Over Time , 2007, SIAM J. Comput..
[24] Roger Wattenhofer,et al. Information dissemination in highly dynamic graphs , 2005, DIALM-POMC '05.
[25] Mohammad Taghi Hajiaghayi,et al. An O(sqrt(n))-approximation algorithm for directed sparsest cut , 2006, Inf. Process. Lett..
[26] Jay E. Aronson,et al. A survey of dynamic network flows , 1989 .
[27] Amit Kumar,et al. Connectivity and inference problems for temporal networks , 2000, Symposium on the Theory of Computing.
[28] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[29] Horst W. Hamacher,et al. Earliest Arrival Flows with Time-Dependent Data , 2003 .
[30] Warren B. Powell,et al. Stochastic and dynamic networks and routing , 1995 .
[31] Natashia Boland,et al. Scheduling arc maintenance jobs in a network to maximize total flow over time , 2014, Discret. Appl. Math..
[32] Éva Tardos,et al. Efficient continuous-time dynamic network flow algorithms , 1998, Oper. Res. Lett..
[33] Paul G. Spirakis,et al. On Verifying and Maintaining Connectivity of Interval Temporal Networks , 2015, ALGOSENSORS.
[34] Martin Skutella,et al. Multiline Addressing by Network Flow , 2008, Algorithmica.
[35] Andrea E. F. Clementi,et al. Flooding Time of Edge-Markovian Evolving Graphs , 2010, SIAM J. Discret. Math..
[36] Jan-Philipp W. Kappmeier. Generalizations of Flows over Time with Applications in Evacuation Optimization , 2015 .
[37] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[38] Mark A. Fuller,et al. Faster Algorithms for the Generalized Network Flow Problem , 1998 .
[39] Emanuele Viola,et al. On the Complexity of Information Spreading in Dynamic Networks , 2013, SODA.
[40] Paul G. Spirakis,et al. Traveling salesman problems in temporal graphs , 2016, Theor. Comput. Sci..
[41] Piotr Sankowski,et al. Single Source -- All Sinks Max Flows in Planar Digraphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[42] Martin Skutella,et al. Earliest Arrival Flows with Multiple Sources , 2009, Math. Oper. Res..
[43] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[44] Éva Tardos,et al. “The quickest transshipment problem” , 1995, SODA '95.
[45] Paul G. Spirakis,et al. Ephemeral networks with random availability of links: diameter and connectivity , 2014, SPAA.
[46] Maria J. Serna. Randomized Parallel Approximations to Max Flow , 2008, Encyclopedia of Algorithms.
[47] Chen Avin,et al. How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) , 2008, ICALP.
[48] Gerhard J. Woeginger,et al. One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs , 1996, WG.
[49] Ma. Preprint 016-2009: Continuous and Discrete Flows Over Time: A General Model Based on Measure Theory , 2010 .
[50] Thomas Erlebach,et al. On Temporal Graph Exploration , 2015, ICALP.
[51] Kenneth A. Berman,et al. Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.
[52] Christian Scheideler. Models and Techniques for Communication in Dynamic Networks , 2002, STACS.