000			01540nam a22004575i 4500
001			978-1-4471-2256-2
003			DE-He213
005			20130515021110.0
007			cr nn 008mamaa
008			111102s2011 xxk| s |||| 0|eng d
020			_a9781447122562 _9978-1-4471-2256-2
024	7		_a10.1007/978-1-4471-2256-2 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
100	1		_aLi, Fajie.
245	1	0	_aEuclidean Shortest Paths _h[electronic resource] : _bExact or Approximate Algorithms / _cby Fajie Li, Reinhard Klette.
260			_aLondon : _bSpringer London, _c2011.
300			_bdigital.
650		0	_aComputer science.
650		0	_aComputer software.
650		0	_aElectronic data processing.
650		0	_aComputational complexity.
650		0	_aOptical pattern recognition.
650		0	_aComputer aided design.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aNumeric Computing.
650	2	4	_aPattern Recognition.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aMath Applications in Computer Science.
650	2	4	_aComputer-Aided Engineering (CAD, CAE) and Design.
700	1		_aKlette, Reinhard.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781447122555
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4471-2256-2
912			_aZDB-2-SCS
999			_c73732 _d73732