國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Efficient Approximation and Online A...

Bampis, Evripidis.

Efficient Approximation and Online AlgorithmsRecent Progress on Classical Combinatorial Optimization Problems and New Applications /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Efficient Approximation and Online Algorithmsedited by Evripidis Bampis, Klaus Jansen, Claire Kenyon.
其他題名:	Recent Progress on Classical Combinatorial Optimization Problems and New Applications /
其他作者:	Bampis, Evripidis.
出版者:	Berlin Heidelberg :Springer-Verlag GmbH.,2006
面頁冊數:	vi, 347 p. :ill., digital ;24 cm.
叢書名:	Lecture Notes in Computer Science,
Contained By:	Springer e-books
標題:	Combinatorial optimization.
電子資源:	http://dx.doi.org/10.1007/11671541
ISBN:	9783540322122 (paper)

Efficient Approximation and Online AlgorithmsRecent Progress on Classical Combinatorial Optimization Problems and New Applications /
Efficient Approximation and Online AlgorithmsRecent Progress on Classical Combinatorial Optimization Problems and New Applications /[electronic resource] :edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon. - Berlin Heidelberg :Springer-Verlag GmbH.,2006 - vi, 347 p. :ill., digital ;24 cm. - Lecture Notes in Computer Science,34840302-9743 ;.

ISBN: 9783540322122 (paper)Subjects--Topical Terms:

185796
Combinatorial optimization.

LC Class. No.: QA164 / .E24 2006

Dewey Class. No.: 005.1

Efficient Approximation and Online AlgorithmsRecent Progress on Classical Combinatorial Optimization Problems and New Applications /
LDR:01007nmm _22002415a_450 001 186566
003 Springer
005 20071113105410.0
006 m d
007 cr nn 008mamaa
008 090528s2006 gw j eng d
020 $a 9783540322122 (paper)
020 $a 9783540322139 (electronic bk.)
035 $a 00333926
050 1 4 $a QA164 $b .E24 2006
082 0 4 $2 22 $a 005.1
090 $a QA164 $b .E27 2006
245 0 0 $a Efficient Approximation and Online Algorithms $b Recent Progress on Classical Combinatorial Optimization Problems and New Applications / $c edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon. $h [electronic resource] :
260 # $a Berlin Heidelberg : $c 2006 $b Springer-Verlag GmbH.,
300 $a vi, 347 p. : $b ill., digital ; $c 24 cm.
440 0 $a Lecture Notes in Computer Science, $v 3484 $x 0302-9743 ;
650 # 0 $a Combinatorial optimization. $3 185796
650 # 0 $a Online algorithms. $3 279054
650 # 0 $a Computer Science. $3 212513
650 # 0 $a Algorithm Analysis and Problem Complexity. $3 273702
650 # 0 $a Algorithms. $3 184661
650 # 0 $a Computer Communication Networks. $3 218087
650 # 0 $a Computer Graphics. $3 274515
650 # 0 $a Discrete Mathematics in Computer Science. $3 274791
650 # 0 $a Numeric Computing. $3 275524
700 0 # $a Bampis, Evripidis. $3 279051
700 0 # $a Jansen, Klaus. $3 279052
700 0 # $a Kenyon, Claire. $3 279053
710 0 # $a SpringerLink (Online service) $3 273601
773 0 # $t Springer e-books
856 4 0 $u http://libsw.nuk.edu.tw:81/login?url=http://dx.doi.org/10.1007/11671541 $z http://dx.doi.org/10.1007/11671541
950 $a Computer Science (Springer-11645; ZDB-2-SCS)