Algorithms and computation: 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings
Gespeichert in:
| Format: | Elektronisch Tagungsbericht E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
| Schriftenreihe: | Lecture notes in computer science
6552 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Literaturangaben |
| Beschreibung: | 1 Online-Ressource (XI, 232 S.) graph. Darst. |
| ISBN: | 9783642190933 9783642190940 |
| DOI: | 10.1007/978-3-642-19094-0 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV037288655 | ||
| 003 | DE-604 | ||
| 005 | 20110413 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 110318s2011 xx d||| o|||| 10||| eng d | ||
| 020 | |a 9783642190933 |9 978-3-642-19093-3 | ||
| 020 | |a 9783642190940 |c Online |9 978-3-642-19094-0 | ||
| 024 | 7 | |a 10.1007/978-3-642-19094-0 |2 doi | |
| 035 | |a (OCoLC)873775037 | ||
| 035 | |a (DE-599)BVBBV037288655 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-19 |a DE-91 |a DE-739 |a DE-384 |a DE-M347 |a DE-20 |a DE-703 |a DE-355 |a DE-92 |a DE-Aug4 |a DE-859 |a DE-706 |a DE-634 | ||
| 084 | |a DAT 000 |2 stub | ||
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Algorithms and computation |b 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |c Naoki Katoh ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
| 300 | |a 1 Online-Ressource (XI, 232 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 6552 | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |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 Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 653 | |a Paperback / softback | ||
| 653 | |a Research | ||
| 653 | |a approximation algorithms | ||
| 653 | |a biconvex graphs | ||
| 653 | |a complexity | ||
| 653 | |a computational geometry | ||
| 653 | |a data structures | ||
| 653 | |a dynamic programming | ||
| 653 | |a lattice reduction | ||
| 653 | |a longest path problem | ||
| 653 | |a moving points | ||
| 653 | |a peer-to-peer systems | ||
| 653 | |a planar graphs | ||
| 653 | |a polynomial algorithm | ||
| 653 | |a probabilistic methods | ||
| 653 | |a shortest path | ||
| 653 | |a tree drawing | ||
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2011 |z Delhi |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 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Katoh, Naoki |e Sonstige |0 (DE-588)143544543 |4 oth | |
| 711 | 2 | |a WALCOM |n 5 |d 2011 |c Delhi |j Sonstige |0 (DE-588)16101196-2 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 6552 |w (DE-604)BV014880109 |9 6552 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-19094-0 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-LNC | ||
| 912 | |a ZDB-2-SCS | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-021201297 | |
Datensatz im Suchindex
| _version_ | 1820875295144542208 |
|---|---|
| adam_text | |
| any_adam_object | |
| author_GND | (DE-588)143544543 |
| building | Verbundindex |
| bvnumber | BV037288655 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 000 DAT 530f |
| collection | ZDB-2-LNC ZDB-2-SCS |
| ctrlnum | (OCoLC)873775037 (DE-599)BVBBV037288655 |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-3-642-19094-0 |
| 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">BV037288655</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110413</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">110318s2011 xx d||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642190933</subfield><subfield code="9">978-3-642-19093-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642190940</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-19094-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-19094-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873775037</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV037288655</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="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-19</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-20</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-706</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and computation</subfield><subfield code="b">5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings</subfield><subfield code="c">Naoki Katoh ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XI, 232 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">6552</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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="653" ind1=" " ind2=" "><subfield code="a">Paperback / softback</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Research</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">approximation algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">biconvex graphs</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational geometry</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">data structures</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dynamic programming</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">lattice reduction</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">longest path problem</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">moving points</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">peer-to-peer systems</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">planar graphs</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">polynomial algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">probabilistic methods</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">shortest path</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">tree drawing</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2011</subfield><subfield code="z">Delhi</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Katoh, Naoki</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)143544543</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">5</subfield><subfield code="d">2011</subfield><subfield code="c">Delhi</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16101196-2</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">6552</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">6552</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-19094-0</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-021201297</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2011 Delhi gnd-content |
| genre_facet | Konferenzschrift 2011 Delhi |
| id | DE-604.BV037288655 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:13:21Z |
| institution | BVB |
| institution_GND | (DE-588)16101196-2 |
| isbn | 9783642190933 9783642190940 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-021201297 |
| oclc_num | 873775037 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-20 DE-703 DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-706 DE-634 |
| owner_facet | DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-20 DE-703 DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-706 DE-634 |
| physical | 1 Online-Ressource (XI, 232 S.) graph. Darst. |
| psigel | ZDB-2-LNC ZDB-2-SCS |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Naoki Katoh ... (eds.) Berlin [u.a.] Springer 2011 1 Online-Ressource (XI, 232 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 6552 Literaturangaben Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Paperback / softback Research approximation algorithms biconvex graphs complexity computational geometry data structures dynamic programming lattice reduction longest path problem moving points peer-to-peer systems planar graphs polynomial algorithm probabilistic methods shortest path tree drawing (DE-588)1071861417 Konferenzschrift 2011 Delhi gnd-content Algorithmus (DE-588)4001183-5 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 Algorithmische Geometrie (DE-588)4130267-9 s Approximationsalgorithmus (DE-588)4500954-5 s Katoh, Naoki Sonstige (DE-588)143544543 oth WALCOM 5 2011 Delhi Sonstige (DE-588)16101196-2 oth Lecture notes in computer science 6552 (DE-604)BV014880109 6552 https://doi.org/10.1007/978-3-642-19094-0 Verlag Volltext |
| spellingShingle | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Lecture notes in computer science Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4120591-1 (DE-588)4130267-9 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |
| title_auth | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |
| title_exact_search | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |
| title_full | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Naoki Katoh ... (eds.) |
| title_fullStr | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Naoki Katoh ... (eds.) |
| title_full_unstemmed | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Naoki Katoh ... (eds.) |
| title_short | Algorithms and computation |
| title_sort | algorithms and computation 5th international workshop walcom 2011 new delhi india february 18 20 2011 proceedings |
| title_sub | 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |
| topic | Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Approximationsalgorithmus Komplexitätstheorie Algorithmische Geometrie Algorithmus Konferenzschrift 2011 Delhi |
| url | https://doi.org/10.1007/978-3-642-19094-0 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT katohnaoki algorithmsandcomputation5thinternationalworkshopwalcom2011newdelhiindiafebruary18202011proceedings AT walcomdelhi algorithmsandcomputation5thinternationalworkshopwalcom2011newdelhiindiafebruary18202011proceedings |