Polynomial time approximation schemes for minimum disk cover problems

By Liao Chen   Hu Shiyan  

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 399-412

Springer Publishing Company

Access to resources Recommend Favorite

A polynomial-time algorithm for linear optimization based on a new simple kernel function

By Bai Y. Q.   Roos C.  

Optimization Methods and Software, Vol. 18, Iss. 6, 2003-12 ,pp. : 631-646

Taylor & Francis Ltd

Access to resources Recommend Favorite

Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems

By Hunt H.B.   Marathe M.V.   Radhakrishnan V.   Ravi S.S.   Rosenkrantz D.J.   Stearns R.E.  

Information and Computation, Vol. 173, Iss. 1, 2002-02 ,pp. : 40-63

Academic Press

Access to resources Recommend Favorite

Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting

By Wasilkowski G.   Woźniakowski H.  

Foundations of Computational Mathematics, Vol. 9, Iss. 1, 2009-02 ,pp. : 105-132

Springer Publishing Company

Access to resources Recommend Favorite

Reoptimization of set covering problems

By Mikhailyuk V.  

Cybernetics and Systems Analysis, Vol. 46, Iss. 6, 2010-11 ,pp. : 879-883

Springer Publishing Company

Access to resources Recommend Favorite