✦ LIBER ✦

Polynomial algorithms for restricted Euclidean p-centre problems

✍ Scribed by Larry Aupperle; J.Mark Keil

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 470 KB
Volume: 23
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(89)90032-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial time dual algorithm for the

A polynomial time dual algorithm for the Euclidean multifacility location problem

✍ G.L. Xue; J.B. Rosen; P.M. Pardalos 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Random pseudo-polynomial algorithms for

Random pseudo-polynomial algorithms for exact matroid problems

✍ P.M Camerini; G Galbiati; F Maffioli 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Improved algorithms for replacement path

Improved algorithms for replacement paths problems in restricted graphs

✍ Amit M. Bhosle 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Generalized matrix Euclidean algorithms

Generalized matrix Euclidean algorithms for solving diophantine equations and associated problems

✍ J.S.H. Tsai; S.S. Chen; L.S. Shieh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 948 KB

Polynomial time approximation algorithms

Polynomial time approximation algorithms for machine scheduling: ten open problems

✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 91 KB 👁 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy

Systems of vectors in Euclidean space an

Systems of vectors in Euclidean space and an extremal problem for polynomials

✍ S. V. Konyagin 📂 Article 📅 1981 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 435 KB