Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

Approximation algorithms for quickest spanning tree problems

Author
HASSIN, Refael1 ; LEVIN, Asaf2
[1] Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel
[2] Faculty of Industrial Engineering and Management, The Technion, Haifa 32000, Israel
Source

Algorithmica. 2005, Vol 41, Num 1, pp 43-52, 10 p ; ref : 11 ref

ISSN
0178-4617
Scientific domain
Computer science
Publisher
Springer, New York, NY
Publication country
United States
Document type
Article
Language
English
Author keyword
Approximation algorithms Minimum diameter spanning tree problem Quickest path problem
Keyword (fr)
Algorithme approximation Arbre maximal Délai transmission Multigraphe Performance algorithme
Keyword (en)
Approximation algorithm Spanning tree Transmission time Multigraph Algorithm performance
Keyword (es)
Algoritmo aproximación Arbol máximo Plazo transmisión Multígrafo Resultado algoritmo
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

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

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