Edward F. Schmeichel

Learn More
(ii) maida Yi 1 f(Xi)l (the Chebyshev error of the fit). We give efficient algorithms to construct a polygonal function f that minimizes (i) (resp. (ii)) under a maximum allowable value of (ii) (resp. (i)), whether or not the comers off are constrained to be in the set S. A key tool used in designing these algorithms is a linear time algorithm to find the(More)
We consider only undirected graphs without loops or multiple edges. Our terminology and notation will be standard except as indicated; a good reference for any undefined terms is [2]. We will use c(G) to denote the number of components of a graph G. Chvtital introduced the notion of tough graphs in [3]. Let t be any positive real number. A graph G is said(More)