Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers
Gespeichert in:
| Format: | Elektronisch Tagungsbericht E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
| Schriftenreihe: | Lecture Notes in Computer Science
6534 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV037236982 | ||
| 003 | DE-604 | ||
| 005 | 20120305 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 110218s2011 xx o|||| 10||| eng d | ||
| 020 | |a 9783642183188 |c Online |9 978-3-642-18318-8 | ||
| 024 | 7 | |a 10.1007/978-3-642-18318-8 |2 doi | |
| 035 | |a (OCoLC)837839251 | ||
| 035 | |a (DE-599)BVBBV037236982 | ||
| 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 | ||
| 082 | 0 | |a 004 | |
| 084 | |a MAT 652f |2 stub | ||
| 084 | |a DAT 000 |2 stub | ||
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Approximation and Online Algorithms |b 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers |c Klaus Jansen ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
| 300 | |a 1 Online-Ressource (X, 273 S.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture Notes in Computer Science |v 6534 | |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Online-Algorithmus |0 (DE-588)4583199-3 |2 gnd |9 rswk-swf |
| 653 | |a Paperback / softback | ||
| 653 | |a Professional/practitioner | ||
| 653 | |a algorithm analysis | ||
| 653 | |a algorithm design | ||
| 653 | |a algorithmic graph theory | ||
| 653 | |a approximation algorithm | ||
| 653 | |a chordal graph | ||
| 653 | |a combinatorial optimization | ||
| 653 | |a competitive analysis | ||
| 653 | |a complexity | ||
| 653 | |a disk graph | ||
| 653 | |a domination search | ||
| 653 | |a dynamic flow | ||
| 653 | |a edge-connectivity | ||
| 653 | |a efficiency | ||
| 653 | |a exponential distribution | ||
| 653 | |a game theory | ||
| 653 | |a graph algorithms | ||
| 653 | |a graph minors | ||
| 653 | |a graphs | ||
| 653 | |a inapproximability | ||
| 653 | |a intersection graph | ||
| 653 | |a interval graph | ||
| 653 | |a linear programs | ||
| 653 | |a matching problem | ||
| 653 | |a network design | ||
| 653 | |a network flow | ||
| 653 | |a node-connectivity | ||
| 653 | |a online algorithms | ||
| 653 | |a planar graph | ||
| 653 | |a precedence constraints | ||
| 653 | |a randomized algorithms | ||
| 653 | |a scheduling | ||
| 653 | |a sensor network | ||
| 653 | |a set cover | ||
| 653 | |a stochastic scheduling | ||
| 653 | |a unit disk graph | ||
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2010 |z Liverpool |2 gnd-content | |
| 689 | 0 | 0 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | 1 | |a Online-Algorithmus |0 (DE-588)4583199-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Jansen, Klaus |e Sonstige |4 oth | |
| 711 | 2 | |a WAOA |n 8 |d 2010 |c Liverpool |j Sonstige |0 (DE-588)16099097-X |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-3-642-18317-1 |
| 830 | 0 | |a Lecture Notes in Computer Science |v 6534 |w (DE-604)BV014880109 |9 6534 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-18318-8 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-LNC | ||
| 912 | |a ZDB-2-SCS | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-021150547 | |
Datensatz im Suchindex
| DE-BY-TUM_katkey | 1758133 |
|---|---|
| DE-BY-UBM_katkey | 4421959 |
| _version_ | 1823054716869804032 |
| adam_text | |
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV037236982 |
| classification_rvk | SS 4800 |
| classification_tum | MAT 652f DAT 000 DAT 530f |
| collection | ZDB-2-LNC ZDB-2-SCS |
| ctrlnum | (OCoLC)837839251 (DE-599)BVBBV037236982 |
| dewey-full | 004 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004 |
| dewey-search | 004 |
| dewey-sort | 14 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1007/978-3-642-18318-8 |
| 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">BV037236982</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120305</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">110218s2011 xx o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642183188</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-18318-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-18318-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)837839251</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV037236982</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="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 652f</subfield><subfield code="2">stub</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">Approximation and Online Algorithms</subfield><subfield code="b">8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers</subfield><subfield code="c">Klaus Jansen ... (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 (X, 273 S.)</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">6534</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Online-Algorithmus</subfield><subfield code="0">(DE-588)4583199-3</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">Professional/practitioner</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">algorithm analysis</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">algorithm design</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">algorithmic graph theory</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">approximation algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">chordal graph</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">combinatorial optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">competitive analysis</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">disk graph</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">domination search</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dynamic flow</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">edge-connectivity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">efficiency</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">exponential distribution</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">game theory</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph minors</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graphs</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">inapproximability</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">intersection graph</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">interval graph</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">linear programs</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">matching problem</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network design</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network flow</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">node-connectivity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">online algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">planar graph</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">precedence constraints</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">randomized algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">scheduling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">sensor network</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">set cover</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">stochastic scheduling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">unit disk graph</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2010</subfield><subfield code="z">Liverpool</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Online-Algorithmus</subfield><subfield code="0">(DE-588)4583199-3</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">Jansen, Klaus</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WAOA</subfield><subfield code="n">8</subfield><subfield code="d">2010</subfield><subfield code="c">Liverpool</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16099097-X</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-18317-1</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science</subfield><subfield code="v">6534</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">6534</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-18318-8</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-021150547</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2010 Liverpool gnd-content |
| genre_facet | Konferenzschrift 2010 Liverpool |
| id | DE-604.BV037236982 |
| illustrated | Not Illustrated |
| indexdate | 2025-02-03T17:28:01Z |
| institution | BVB |
| institution_GND | (DE-588)16099097-X |
| isbn | 9783642183188 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-021150547 |
| oclc_num | 837839251 |
| 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 (X, 273 S.) |
| 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 |
| spellingShingle | Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers Lecture Notes in Computer Science Approximation (DE-588)4002498-2 gnd Online-Algorithmus (DE-588)4583199-3 gnd |
| subject_GND | (DE-588)4002498-2 (DE-588)4583199-3 (DE-588)1071861417 |
| title | Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers |
| title_auth | Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers |
| title_exact_search | Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers |
| title_full | Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers Klaus Jansen ... (eds.) |
| title_fullStr | Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers Klaus Jansen ... (eds.) |
| title_full_unstemmed | Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers Klaus Jansen ... (eds.) |
| title_short | Approximation and Online Algorithms |
| title_sort | approximation and online algorithms 8th international workshop waoa 2010 liverpool uk september 9 10 2010 revised papers |
| title_sub | 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers |
| topic | Approximation (DE-588)4002498-2 gnd Online-Algorithmus (DE-588)4583199-3 gnd |
| topic_facet | Approximation Online-Algorithmus Konferenzschrift 2010 Liverpool |
| url | https://doi.org/10.1007/978-3-642-18318-8 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT jansenklaus approximationandonlinealgorithms8thinternationalworkshopwaoa2010liverpoolukseptember9102010revisedpapers AT waoaliverpool approximationandonlinealgorithms8thinternationalworkshopwaoa2010liverpoolukseptember9102010revisedpapers |