Approximating the stretch factor of euclidean graphs
- Author
- NARASIMHAN, Giri1 ; SMID, Michiel2
[1] Department of Mathematical Sciences, The University of Memphis, Memphis, TN 38152, United States
[2] Department of Computer Science, University of Magdeburg, 39106 Magdeburg, Germany - Source
SIAM journal on computing (Print). 2001, Vol 30, Num 3, pp 978-989 ; ref : 24 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
- Keyword (fr)
- Algorithme Approximation Arbre graphe Arbre maximal Chemin graphe Cycle graphe Distance Graphe planaire Géométrie algorithmique Mot Plus court chemin Question documentaire Sommet graphe Théorie graphe Vertex Graphe euclidéen Paire bien séparée Solution approchée WSPD
- Keyword (en)
- Algorithm Approximation Tree(graph) Spanning tree Graph path Cycle(graph) Distance Planar graph Computational geometry Word Shortest path Query Vertex(graph) Graph theory Vertex Euclidean graph Well separated pair Approximate solution Well separated pair decomposition
- Keyword (es)
- Algoritmo Aproximación Arbol grafo Arbol máximo Camino grafo Ciclo diagrama Distancia Grafo planario Geometría computacional Palabra Camino más corto Pregunta documental Vértice grafo Teoría grafo Vértice
- 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
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence / 001D02C03 Pattern recognition. Digital image processing. Computational geometry
- Discipline
- Computer science : theoretical automation and systems Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 989158
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
Install on your browser
DOI
10.1137/S0097539799361671 
https://dx.doi.org/10.1137/S0097539799361671
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0097539799361671\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:52:\"Approximating the stretch factor of euclidean graphs\";s:9:\"\u0000*\u0000jtitle\";s:33:\"SIAM journal on computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:23:\"SIAM j. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"978\";s:8:\"\u0000*\u0000epage\";s:3:\"989\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0097-5397\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"NARASIMHAN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Giri\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:13:\"SMID, Michiel\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:52:\"Approximating the stretch factor of euclidean graphs\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0097539799361671\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:52:\"Approximating the stretch factor of euclidean graphs\";s:9:\"\u0000*\u0000jtitle\";s:33:\"SIAM journal on computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:23:\"SIAM j. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"978\";s:8:\"\u0000*\u0000epage\";s:3:\"989\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0097-5397\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"NARASIMHAN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Giri\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:13:\"SMID, Michiel\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:52:\"Approximating the stretch factor of euclidean graphs\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0097539799361671\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0097539799361671\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:52:\"Approximating the stretch factor of euclidean graphs\";s:9:\"\u0000*\u0000jtitle\";s:33:\"SIAM journal on computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:23:\"SIAM j. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"978\";s:8:\"\u0000*\u0000epage\";s:3:\"989\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0097-5397\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"NARASIMHAN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Giri\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:13:\"SMID, Michiel\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:52:\"Approximating the stretch factor of euclidean graphs\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0097539799361671\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:52:\"Approximating the stretch factor of euclidean graphs\";s:9:\"\u0000*\u0000jtitle\";s:33:\"SIAM journal on computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:23:\"SIAM j. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"978\";s:8:\"\u0000*\u0000epage\";s:3:\"989\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0097-5397\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"NARASIMHAN\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Giri\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:13:\"SMID, Michiel\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:52:\"Approximating the stretch factor of euclidean graphs\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
