Florida International University
Edit Your Profile
FIU Discovery
Toggle navigation
Browse
Home
People
Organizations
Scholarly & Creative Works
Research Facilities
Support
Edit Your Profile
Approximating geometric bottleneck shortest paths
Article
Bose, P, Maheshwari, A, Narasimhan, G
et al
. (2003). Approximating geometric bottleneck shortest paths .
EURO-PAR 2011 PARALLEL PROCESSING, PT 1,
2607 38-49.
Share this citation
Twitter
Email
Bose, P, Maheshwari, A, Narasimhan, G
et al
. (2003). Approximating geometric bottleneck shortest paths .
EURO-PAR 2011 PARALLEL PROCESSING, PT 1,
2607 38-49.
Copy Citation
Share
International Collaboration
Overview
Research
Location
Additional Document Info
View All
Overview
cited authors
Bose, P; Maheshwari, A; Narasimhan, G; Smid, M; Zeh, N
authors
Narasimhan, Giri
publication date
January 1, 2003
webpage
https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000182656100005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=e451fd656366bf1ec5554941920a9ccb
published in
DISTRIBUTED COMPUTING (DISC 2014)
Book
Research
keywords
Computer Science
Computer Science, Theory & Methods
GRAPHS
Science & Technology
Technology
Location
Location
BERLIN, GERMANY
Additional Document Info
publisher
SPRINGER-VERLAG BERLIN
start page
38
end page
49
volume
2607