Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

A simple approximation algorithm for the weighted matching problem

Author
DRAKE, Doratha E1 ; HOUGARDY, Stefan1
[1] Institut für Informatik, Humboldt-Universität zu Berlin, 10099 Berlin, Germany
Source

Information processing letters. 2003, Vol 85, Num 4, pp 211-213, 3 p ; ref : 8 ref

CODEN
IFPLAT
ISSN
0020-0190
Scientific domain
Computer science
Publisher
Elsevier Science, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
1999 Algorithme approximation Algorithme glouton Analyse algorithme Analyse temporelle Approximation linéaire Approximation numérique Concordance Couplage graphe Graphe Maximum Performance algorithme Poids Problème Résultat Temps linéaire Théorie graphe Utilisation 68R10
Keyword (en)
1999 Approximation algorithm Greedy algorithm Algorithm analysis Time analysis Linear approximation Numerical approximation Concordance Graph matching Graph Maximum Algorithm performance Weight Problem Result Linear time Graph theory Use
Keyword (es)
1999 Algoritmo aproximación Algoritmo glotón Análisis algoritmo Análisis temporal Aproximación lineal Aproximación numérica Concordancia Acoplamiento grafo Grafo Máximo Resultado algoritmo Peso Problema Resultado Tiempo lineal Teoría grafo Utilización
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01C Graph theory

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
14467231

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

Searching the Web