메뉴 건너뛰기




Volumn , Issue , 2013, Pages 1341-1347

Enabling E-mobility: Facility location for battery loading stations

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT APPROXIMATION ALGORITHMS; ELECTRIC VEHICLES (EVS); ENERGY STORAGE DENSITY; FACILITY LOCATIONS; MINIMIZING THE NUMBER OF; POLYNOMIAL-TIME; REAL-WORLD PROBLEM; SPECIAL STRUCTURE;

EID: 84893390903     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (9)
  • 1
    • 78349236202 scopus 로고    scopus 로고
    • The shortest path problem revisited: Optimal routing for electric vehicles
    • Artmeier, A.; Haselmayr, J.; Leucker, M.; and Sachenbacher, M. 2010. The shortest path problem revisited: Optimal routing for electric vehicles. In KI, 309-316.
    • (2010) KI , pp. 309-316
    • Artmeier, A.1    Haselmayr, J.2    Leucker, M.3    Sachenbacher, M.4
  • 3
    • 85107641719 scopus 로고    scopus 로고
    • Optimal route planning for electric vehicles in large networks
    • Eisner, J.; Funke, S.; and Storandt, S. 2011. Optimal route planning for electric vehicles in large networks. In AAAI.
    • (2011) AAAI
    • Eisner, J.1    Funke, S.2    Storandt, S.3
  • 4
    • 0032108328 scopus 로고    scopus 로고
    • A threshold of ln n for approximating set cover
    • Feige, U. 1998. A threshold of ln n for approximating set cover. J. ACM 45(4):634-652.
    • (1998) J. ACM , vol.45 , Issue.4 , pp. 634-652
    • Feige, U.1
  • 5
    • 33744941093 scopus 로고    scopus 로고
    • The set cover with pairs problem
    • Sarukkai, S., and Sen, S., eds., volume 3821 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg
    • Hassin, R., and Segev, D. 2005. The set cover with pairs problem. In Sarukkai, S., and Sen, S., eds., FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, volume 3821 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg. 164-176.
    • (2005) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science , pp. 164-176
    • Hassin, R.1    Segev, D.2
  • 7
    • 0242269933 scopus 로고    scopus 로고
    • On the hardness of approximating spanners
    • 10.1007/s00453-001-0021-y
    • Kortsarz, G. 2001. On the hardness of approximating spanners. Algorithmica 30:432-450. 10.1007/s00453-001-0021-y.
    • (2001) Algorithmica , vol.30 , pp. 432-450
    • Kortsarz, G.1
  • 8
    • 59049092640 scopus 로고    scopus 로고
    • Construction of strongly connected dominating sets in asymmetric multihop wireless networks
    • Li, D.; Du, H.; Wan, P.-J.; Gao, X.; Zhang, Z.; and Wu, W. 2009. Construction of strongly connected dominating sets in asymmetric multihop wireless networks. Theoretical Computer Science 410(810):661 - 669.
    • (2009) Theoretical Computer Science , vol.410 , Issue.810 , pp. 661-669
    • Li, D.1    Du, H.2    Wan, P.-J.3    Gao, X.4    Zhang, Z.5    Wu, W.6
  • 9
    • 85167403718 scopus 로고    scopus 로고
    • Cruising with a batterypowered vehicle and not getting stranded
    • Storandt, S., and Funke, S. 2012. Cruising with a batterypowered vehicle and not getting stranded. In AAAI.
    • (2012) AAAI
    • Storandt, S.1    Funke, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.