Shortest path tree - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-07-11 14:03:09 Graph theory Mathematics Computational complexity theory Edsger W. Dijkstra Combinatorial optimization Network theory Maximal independent set Graph coloring Shortest path problem Matching Leader election Minimum spanning tree		Add to Reading List Source URL: security.cs.georgetown.edu Download Document from Source Website File Size: 362,19 KB Share Document on Facebook

	arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre DocID: 1xTSz - View Document
	APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran DocID: 1vegv - View Document
	⋆ Combinatorial Optimization (Oberwolfach, November 9–15, Discrete DC Programming by Discrete Convex Analysis —Use of Conjugacy— Kazuo Murota (U. Tokyo) DocID: 1uRbH - View Document
	Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment DocID: 1uvqi - View Document
	In silico optimization of a guava antimicrobial peptide enables combinatorial exploration for peptide design DocID: 1u55o - View Document