Approximating k-center in planar graphs David Eisenstat∗ Philip N. Klein∗ Abstract

First Page		Document Content
Date: 2013-10-10 10:36:31 NP-complete problems Graph operations Dominating set Neighbourhood Tree decomposition Tree Planar graph Graph Degree Graph theory Mathematics Theoretical computer science		Approximating k-center in planar graphs David Eisenstat∗ Philip N. Klein∗ Abstract Add to Reading List Source URL: www.di.ens.fr Download Document from Source Website File Size: 378,89 KB Share Document on Facebook

	Velocity-based Storage and Stowage Decisions in a Semiautomated Fulfillment System by Rong Yuan Submitted to the Sloan School of Management on July 19, 2016 in partial fulfillment of the requirements for the degree of Do DocID: 1xVMp - View Document
	Degree of Regularity for HFEv and HFEvJintai Ding 1 1? and Bo-Yin Yang DocID: 1xVKU - View Document
	ON PRIME FANO VARIETIES OF DEGREE 10 AND COINDEX 3 OLIVIER DEBARRE Abstract. We discuss the period maps of certain (complex) Fano fourfolds. The first part of this talk deals with cubic fourfolds. We recall their Hodge s DocID: 1xVtZ - View Document
	Program Analyses for Understanding the Behavior and Performance of Traditional and Mobile Object-Oriented Software Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in DocID: 1xVqM - View Document
	ON PRIME FANO VARIETIES OF DEGREE 10 AND COINDEX 3 OLIVIER DEBARRE Abstract. According to Gushel and Mukai, most Fano varieties of degree 10, dimension n, and coindex 3 (index n−2) are obtained as linear sections of th DocID: 1xVgI - View Document