Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19895583

APPROXIMATING THE RADII OF POINT SETS

Author
VARADARAJAN, Kasturi1 ; VENKATESH, S2 ; YINYU YE3 ; JIAWEI ZHANG4
[1] Department of Computer Science, The University of Iowa, Iowa City, IA 52242-1419, United States
[2] Department of Computer Science, University of Victoria, PO Box 3055, STN CSC, Victoria V8W 3P6, BC, Canada
[3] Management Science and Engineering and, by courtesy, Electrical Engineering, Stanford University, Stanford, CA 94305, United States
[4] IOMS-Operations Management, Stern School of Business, New York University, 44 W. 4th Street, Suite 8-66, New York, NY 10012-1126, United States
Source

SIAM journal on computing (Print). 2007, Vol 36, Num 6, pp 1764-1776, 13 p ; ref : 28 ref

ISSN
0097-5397
Scientific domain
Computer science; Mathematics
Publisher
Society for Industrial and Applied Mathematics, Philadelphia, PA
Publication country
United States
Document type
Article
Language
English
Author keyword
68W20 68W25 68W40 approximation algorithms computational convexity semidefinite programming
Keyword (fr)
Algorithme approximation Application Approximation Calcul automatique Construction Convexité Distance Géométrie Largeur Nombre entier Polynôme Preuve Procédure Programmation semi définie Relaxation Temps polynomial Théorie algorithme Théorie preuve Théorie programmation 03Fxx 68T15 68W25 68Wxx Algorithme polynomial PCP Problème NP
Keyword (en)
Approximation algorithm Application Approximation Computing Construction Convexity Distance Geometry Width Integer Polynomial Proof Procedure Semi definite programming Relaxation Polynomial time Algorithm theory Proof theory Programming theory
Keyword (es)
Algoritmo aproximación Aplicación Aproximación Cálculo automático Construcción Convexidad Distancia Geometría Ancho Entero Polinomio Prueba Procedimiento Programacíon semi definida Relajación Tiempo polinomial Teoría demonstración
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02A Mathematical logic, foundations, set theory / 001A02A01 Logic and foundations / 001A02A01F Proof theory and constructive mathematics

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A08 Miscellaneous

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence / 001D02C02 Learning and adaptive systems

Discipline
Computer science : theoretical automation and systems Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
19895583

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web