An efficient approximation for weighted region shortest path problem
Publication
, Conference
Reif, J; Sun, Z
Published in: ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS
January 1, 2001
Duke Scholars
Published In
ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS
ISBN
1-56881-125-X
Publication Date
January 1, 2001
Start / End Page
191 / 203
Location
DARTMOUTH COLL, HANOVER, NH
Publisher
A K PETERS, LTD
Conference Name
4th International Workshop on the Algorithmic Foundations of Robotics (WAFR)
Citation
APA
Chicago
ICMJE
MLA
NLM
Reif, J., & Sun, Z. (2001). An efficient approximation for weighted region shortest path problem. In B. R. Donald, K. M. Lynch, & D. Rus (Eds.), ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS (pp. 191–203). DARTMOUTH COLL, HANOVER, NH: A K PETERS, LTD.
Reif, J., and Z. Sun. “An efficient approximation for weighted region shortest path problem.” In ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS, edited by B. R. Donald, K. M. Lynch, and D. Rus, 191–203. A K PETERS, LTD, 2001.
Reif J, Sun Z. An efficient approximation for weighted region shortest path problem. In: Donald BR, Lynch KM, Rus D, editors. ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS. A K PETERS, LTD; 2001. p. 191–203.
Reif, J., and Z. Sun. “An efficient approximation for weighted region shortest path problem.” ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS, edited by B. R. Donald et al., A K PETERS, LTD, 2001, pp. 191–203.
Reif J, Sun Z. An efficient approximation for weighted region shortest path problem. In: Donald BR, Lynch KM, Rus D, editors. ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS. A K PETERS, LTD; 2001. p. 191–203.
Published In
ALGORITHMIC AND COMPUTATIONAL ROBOTICS: NEW DIRECTIONS
ISBN
1-56881-125-X
Publication Date
January 1, 2001
Start / End Page
191 / 203
Location
DARTMOUTH COLL, HANOVER, NH
Publisher
A K PETERS, LTD
Conference Name
4th International Workshop on the Algorithmic Foundations of Robotics (WAFR)