Ludwig, Arne; Marcinkowski, Jan; Schmid, Stefan Scheduling loop-free network updates: it’s good to relax! (English) Zbl 1333.68215 Proceedings of the 2015 ACM symposium on principles of distributed computing, PODC ’15, Donostia-San Sebastián, Spain, July 21–23, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3617-8). 13-22 (2015). Cited in 5 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 05C85 Graph algorithms (graph-theoretic aspects) 68M20 Performance evaluation, queueing, and scheduling in the context of computer systems 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) 68W15 Distributed algorithms Keywords:NP-hardness; graph algorithms; scheduling; software-defined networking PDFBibTeX XMLCite \textit{A. Ludwig} et al., in: Proceedings of the 34th ACM symposium on principles of distributed computing, PODC '15, Donostia-San Sebastián, Spain, July 21--23, 2015. New York, NY: Association for Computing Machinery (ACM). 13--22 (2015; Zbl 1333.68215) Full Text: DOI References: [1] C. H. Papadimitriou and S. S. Vempala. Cortical learning via prediction. In Proc. of COLT, 2015. [2] L. G. Valiant. Circuits of the mind. Oxford University Press, 1994. · Zbl 0839.68078 [3] L. G. Valiant. Memorization and association on a realistic neural model. Neural Computation, 17(3):527 555, 2005. · Zbl 1089.68612 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.