Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, the problem of computing a low weight spanning tree such that the degree of each vertex is at most its specified bound is considered. In particular, modifying a given spanning tree T using adoptions to meet the degree constraints is considered. A novel network-flow based algorithm for finding...

Abstrak. Biochar merupakan padatan berupa arang yang kaya karbon (C) melalui proses pembakaran tidak sempurna dengan minimum oksigen (pyrolisis). Penambahan bahan organik dapat mempercepat pemulihan kualitas lahan serta meningkatkan kekuatan tanah memegang air sehingga kandungan unsur hara juga meningkat. Pemanfaatan kompos berpengaruh terhadap pasokan tanah, perubahan sifat fisik, biologi, dan...

This is a correction to R. B. Kearfott and S. Hongthong’s article [SIAM J. Optim., 16 (2005), pp. 418–433]. DOI. 10.1137/100816080 There are errors in column 4 (entitled “Under / over estimators”) of rows 3, 4, and 5 of Table 4.1, on p. 426 of [1]. As a consequence, references to those entries in the table on lines 1 and 2 below the table (on page 426) and on lines 5, 6, 7, and 8 of section 4.1...

We give a new characterization of the solutions set of the general (inconsistent) linear least-squares problem using the set of limit-points of an extended version of the classical Kaczmarz's projections method.We also obtain a \ step error reduction formula" which,at least from a theoretical view point,can give us information about the convergence properties of the algorithm.In section 3 we pr...