Frontiers in algorithmics and algorithmic aspects in information and management: Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings
Gespeichert in:
Weitere Verfasser: | |
---|---|
Format: | Elektronisch Tagungsbericht E-Book |
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
Schriftenreihe: | Lecture notes in computer science
7285 |
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | 1 Online-Ressource (XVII, 370 S.) graph. Darst. |
ISBN: | 3642296998 9783642297007 |
DOI: | 10.1007/978-3-642-29700-7 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV040160781 | ||
003 | DE-604 | ||
007 | cr|uuu---uuuuu | ||
008 | 120530s2012 gw d||| o|||| 10||| eng d | ||
015 | |a 12,N13 |2 dnb | ||
020 | |a 3642296998 |9 3-642-29699-8 | ||
020 | |a 9783642297007 |c Online |9 978-3-642-29700-7 | ||
024 | 7 | |a 10.1007/978-3-642-29700-7 |2 doi | |
024 | 3 | |a 9783642296994 | |
028 | 5 | 2 | |a Best.-Nr.: 86091339 |
035 | |a (OCoLC)799086388 | ||
035 | |a (DE-599)BVBBV040160781 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE-BE | ||
049 | |a DE-19 |a DE-473 |a DE-20 |a DE-91 |a DE-739 |a DE-384 |a DE-M347 |a DE-703 |a DE-355 |a DE-92 |a DE-Aug4 |a DE-859 |a DE-634 |a DE-706 | ||
082 | 0 | |a 004.0151 |2 22//ger | |
084 | |a 004 |2 sdnb | ||
084 | |a DAT 000 |2 stub | ||
245 | 1 | 0 | |a Frontiers in algorithmics and algorithmic aspects in information and management |b Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |c Jack Snoeyink ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2012 | |
300 | |a 1 Online-Ressource (XVII, 370 S.) |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 7285 | |
650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2012 |z Peking |2 gnd-content | |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 0 | 2 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Snoeyink, Jack |4 edt | |
711 | 2 | |a FAW-AAIM |d 2012 |c Peking |j Sonstige |0 (DE-588)1022159798 |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-3-642-29699-4 |
830 | 0 | |a Lecture notes in computer science |v 7285 |w (DE-604)BV014880109 |9 7285 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-29700-7 |x Verlag |3 Volltext |
912 | |a ZDB-2-LNC | ||
912 | |a ZDB-2-SCS | ||
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-025017322 |
Datensatz im Suchindex
_version_ | 1820875387253555200 |
---|---|
adam_text | |
any_adam_object | |
author2 | Snoeyink, Jack |
author2_role | edt |
author2_variant | j s js |
author_facet | Snoeyink, Jack |
building | Verbundindex |
bvnumber | BV040160781 |
classification_rvk | SS 4800 |
classification_tum | DAT 000 |
collection | ZDB-2-LNC ZDB-2-SCS |
ctrlnum | (OCoLC)799086388 (DE-599)BVBBV040160781 |
dewey-full | 004.0151 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004.0151 |
dewey-search | 004.0151 |
dewey-sort | 14.0151 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
doi_str_mv | 10.1007/978-3-642-29700-7 |
format | Electronic Conference Proceeding eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV040160781</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">120530s2012 gw d||| o|||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,N13</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642296998</subfield><subfield code="9">3-642-29699-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642297007</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-29700-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-29700-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642296994</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 86091339</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)799086388</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV040160781</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">22//ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Frontiers in algorithmics and algorithmic aspects in information and management</subfield><subfield code="b">Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings</subfield><subfield code="c">Jack Snoeyink ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 370 S.)</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7285</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2012</subfield><subfield code="z">Peking</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Snoeyink, Jack</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">FAW-AAIM</subfield><subfield code="d">2012</subfield><subfield code="c">Peking</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1022159798</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-3-642-29699-4</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7285</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">7285</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-29700-7</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025017322</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2012 Peking gnd-content |
genre_facet | Konferenzschrift 2012 Peking |
id | DE-604.BV040160781 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:14:49Z |
institution | BVB |
institution_GND | (DE-588)1022159798 |
isbn | 3642296998 9783642297007 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025017322 |
oclc_num | 799086388 |
open_access_boolean | |
owner | DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-703 DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-634 DE-706 |
owner_facet | DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-703 DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-634 DE-706 |
physical | 1 Online-Ressource (XVII, 370 S.) graph. Darst. |
psigel | ZDB-2-LNC ZDB-2-SCS |
publishDate | 2012 |
publishDateSearch | 2012 |
publishDateSort | 2012 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Jack Snoeyink ... (eds.) Berlin [u.a.] Springer 2012 1 Online-Ressource (XVII, 370 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 7285 Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2012 Peking gnd-content Algorithmus (DE-588)4001183-5 s Komplexitätstheorie (DE-588)4120591-1 s Optimierungsproblem (DE-588)4390818-4 s DE-604 Snoeyink, Jack edt FAW-AAIM 2012 Peking Sonstige (DE-588)1022159798 oth Erscheint auch als Druck-Ausgabe, Paperback 978-3-642-29699-4 Lecture notes in computer science 7285 (DE-604)BV014880109 7285 https://doi.org/10.1007/978-3-642-29700-7 Verlag Volltext |
spellingShingle | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Lecture notes in computer science Optimierungsproblem (DE-588)4390818-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4390818-4 (DE-588)4120591-1 (DE-588)4001183-5 (DE-588)1071861417 |
title | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |
title_auth | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |
title_exact_search | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |
title_full | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Jack Snoeyink ... (eds.) |
title_fullStr | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Jack Snoeyink ... (eds.) |
title_full_unstemmed | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Jack Snoeyink ... (eds.) |
title_short | Frontiers in algorithmics and algorithmic aspects in information and management |
title_sort | frontiers in algorithmics and algorithmic aspects in information and management joint international conference faw aaim 2012 beijing china may 14 16 2012 proceedings |
title_sub | Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |
topic | Optimierungsproblem (DE-588)4390818-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Optimierungsproblem Komplexitätstheorie Algorithmus Konferenzschrift 2012 Peking |
url | https://doi.org/10.1007/978-3-642-29700-7 |
volume_link | (DE-604)BV014880109 |
work_keys_str_mv | AT snoeyinkjack frontiersinalgorithmicsandalgorithmicaspectsininformationandmanagementjointinternationalconferencefawaaim2012beijingchinamay14162012proceedings AT fawaaimpeking frontiersinalgorithmicsandalgorithmicaspectsininformationandmanagementjointinternationalconferencefawaaim2012beijingchinamay14162012proceedings |