Greedy Algorithms /

Greedy Algorithms / / edited by Witold Bednorz.

Show other versions (1)

Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remark...

Full description

Saved in:
Bibliographic Details
TeilnehmendeR:
Bednorz, Witold,
Place / Publishing House:Rijek, Crotia : : InTech,, 2008.
Year of Publication:2008
Language:English
Physical Description:1 online resource (596 pages) :; illustrations
Tags: Add Tag
No Tags, Be the first to tag this record!
id 993547974104498
ctrlnum (CKB)3230000000076179
(NjHacI)993230000000076179
(oapen)https://directory.doabooks.org/handle/20.500.12854/64701
(EXLCZ)993230000000076179
collection bib_alma
record_format marc
spelling Bednorz, Witold edt
Greedy Algorithms / edited by Witold Bednorz.
IntechOpen 2008
Rijek, Crotia : InTech, 2008.
1 online resource (596 pages) : illustrations
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Description based on print version record.
Includes bibliographical references.
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remarks or theorems.
English
Algorithms.
Algorithms & data structures
953-7619-27-3
Bednorz, Witold, editor.
language English
format eBook
author2 Bednorz, Witold,
author_facet Bednorz, Witold,
author2_variant w b wb
w b wb
author2_role TeilnehmendeR
title Greedy Algorithms /
spellingShingle Greedy Algorithms /
title_full Greedy Algorithms / edited by Witold Bednorz.
title_fullStr Greedy Algorithms / edited by Witold Bednorz.
title_full_unstemmed Greedy Algorithms / edited by Witold Bednorz.
title_auth Greedy Algorithms /
title_new Greedy Algorithms /
title_sort greedy algorithms /
publisher IntechOpen
InTech,
publishDate 2008
physical 1 online resource (596 pages) : illustrations
isbn 953-51-5798-1
953-7619-27-3
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA9
callnumber-sort QA 19.58 G744 42008
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 518 - Numerical analysis
dewey-full 518.1
dewey-sort 3518.1
dewey-raw 518.1
dewey-search 518.1
work_keys_str_mv AT bednorzwitold greedyalgorithms
status_str n
ids_txt_mv (CKB)3230000000076179
(NjHacI)993230000000076179
(oapen)https://directory.doabooks.org/handle/20.500.12854/64701
(EXLCZ)993230000000076179
carrierType_str_mv cr
is_hierarchy_title Greedy Algorithms /
author2_original_writing_str_mv noLinkedField
_version_ 1758567923006308352
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00916nam a2200301 i 4500</leader><controlfield tag="001">993547974104498</controlfield><controlfield tag="005">20221011103359.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |||||||||||</controlfield><controlfield tag="008">221011s2008 ci a ob 000 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">953-51-5798-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)3230000000076179</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(NjHacI)993230000000076179</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/64701</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)993230000000076179</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">NjHacI</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="c">NjHacl</subfield></datafield><datafield tag="041" ind1="1" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.58</subfield><subfield code="b">.G744 2008</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">518.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bednorz, Witold</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Greedy Algorithms /</subfield><subfield code="c">edited by Witold Bednorz.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="b">IntechOpen</subfield><subfield code="c">2008</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rijek, Crotia :</subfield><subfield code="b">InTech,</subfield><subfield code="c">2008.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (596 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on print version record.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remarks or theorems.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorithms &amp; data structures</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">953-7619-27-3</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bednorz, Witold,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-02-22 21:00:45 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2012-12-09 08:17:33 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&amp;portfolio_pid=5338694790004498&amp;Force_direct=true</subfield><subfield code="Z">5338694790004498</subfield><subfield code="8">5338694790004498</subfield></datafield></record></collection>

Similar Items