The Power of Recourse for Online MST and TSP Nicole Megow1 , Martin Skutella1? , Jos´e Verschae2?? , and Andreas Wiese3? ? ? 1 3

First Page		Document Content
Date: 2012-11-23 03:19:45 Analysis of algorithms Operations research Spanning tree Online algorithms Minimum spanning tree Amortized analysis Travelling salesman problem Competitive analysis Randomized algorithm Theoretical computer science Computational complexity theory Mathematics		The Power of Recourse for Online MST and TSP Nicole Megow1 , Martin Skutella1? , Jos´e Verschae2?? , and Andreas Wiese3? ? ? 1 3 Add to Reading List Source URL: www.coga.tu-berlin.de Download Document from Source Website File Size: 319,78 KB Share Document on Facebook

	O NLINE A LGORITHMS FOR S UM -P RODUCT N ETWORKS WITH C ONTINUOUS VARIABLES Online Algorithms for Sum-Product Networks with Continuous Variables Priyank Jaini1 Abdullah Rashwan1 DocID: 1vmR0 - View Document
	ALTERNATING DIRECTION ALGORITHMS FOR TOTAL VARIATION DECONVOLUTION IN IMAGE RECONSTRUCTION MIN TAO∗ AND JUNFENG YANG ∗ DocID: 1vmbs - View Document
	Converting Online Algorithms to Local Computation Algorithms Yishay Mansour1 ? , Aviad Rubinstein1 ?? , Shai Vardi1 ? ? ? , and Ning Xie2 † 1 School of Computer Science, Tel Aviv University, Israel DocID: 1v34V - View Document
	Online Algorithms for Geographical Load Balancing Minghong Lin∗ , Zhenhua Liu∗ , Adam Wierman∗ , Lachlan L. H. Andrew† ∗ California Institute of Technology, Email: {mhlin,zhenhua,adamw}@caltech.edu † Swinburn DocID: 1uB2U - View Document
	Offline Evaluation of Online Reinforcement Learning Algorithms Travis Mandel1 , Yun-En Liu2 , Emma Brunskill3 , and Zoran Popovi´c1,2 1 Center for Game Science, Computer Science & Engineering, University of Washington, DocID: 1unD1 - View Document