Approximation, randomization, and combinatorial optimization: algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings
Gespeichert in:
Format: | Elektronisch Tagungsbericht E-Book |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2009
|
Schriftenreihe: | Lecture Notes in Computer Science
5687 |
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | 1 Online-Ressource (XII, 740 S.) |
ISBN: | 9783642036859 |
DOI: | 10.1007/978-3-642-03685-9 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV035694816 | ||
003 | DE-604 | ||
005 | 20090902 | ||
007 | cr|uuu---uuuuu | ||
008 | 090826s2009 xx o|||| 00||| eng d | ||
020 | |a 9783642036859 |c Online |9 978-3-642-03685-9 | ||
024 | 7 | |a 10.1007/978-3-642-03685-9 |2 doi | |
035 | |a (OCoLC)1074138583 | ||
035 | |a (DE-599)BVBBV035694816 | ||
040 | |a DE-604 |b ger | ||
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-703 |a DE-706 |a DE-634 |a DE-355 | ||
084 | |a MAT 913f |2 stub | ||
084 | |a DAT 537f |2 stub | ||
084 | |a MAT 410f |2 stub | ||
084 | |a DAT 517f |2 stub | ||
084 | |a DAT 000 |2 stub | ||
245 | 1 | 0 | |a Approximation, randomization, and combinatorial optimization |b algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |c Irit Dinur ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2009 | |
300 | |a 1 Online-Ressource (XII, 740 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 5687 | |
650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Randomisierung |0 (DE-588)4280827-3 |2 gnd |9 rswk-swf |
655 | 7 | |8 1\p |0 (DE-588)1071861417 |a Konferenzschrift |y 2009 |z Berkeley Calif. |2 gnd-content | |
689 | 0 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
689 | 0 | 1 | |a Randomisierung |0 (DE-588)4280827-3 |D s |
689 | 0 | |8 2\p |5 DE-604 | |
689 | 1 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
689 | 1 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
689 | 1 | |8 3\p |5 DE-604 | |
700 | 1 | |a Dinur, Irut |e Sonstige |4 oth | |
711 | 2 | |a APPROX |n 12 |d 2009 |c Berkeley, Calif. |j Sonstige |0 (DE-588)16177950-5 |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-3-642-03684-2 |
830 | 0 | |a Lecture Notes in Computer Science |v 5687 |w (DE-604)BV014880109 |9 5687 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-03685-9 |x Verlag |3 Volltext |
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
912 | |a ZDB-2-LNC | ||
912 | |a ZDB-2-SCS | ||
940 | 1 | |q UBR Paketkauf 2024 | |
940 | 1 | |q ZDB-2-SCS_2009 | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017748837 |
Datensatz im Suchindex
_version_ | 1821319942804340736 |
---|---|
adam_text | |
any_adam_object | |
building | Verbundindex |
bvnumber | BV035694816 |
classification_rvk | SS 4800 |
classification_tum | MAT 913f DAT 537f MAT 410f DAT 517f DAT 000 |
collection | ZDB-2-LNC ZDB-2-SCS |
ctrlnum | (OCoLC)1074138583 (DE-599)BVBBV035694816 |
discipline | Informatik Mathematik |
doi_str_mv | 10.1007/978-3-642-03685-9 |
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">BV035694816</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090902</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">090826s2009 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642036859</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-03685-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-03685-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1074138583</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035694816</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</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-703</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 410f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</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="245" ind1="1" ind2="0"><subfield code="a">Approximation, randomization, and combinatorial optimization</subfield><subfield code="b">algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings</subfield><subfield code="c">Irit Dinur ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 740 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">5687</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">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2009</subfield><subfield code="z">Berkeley Calif.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dinur, Irut</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">APPROX</subfield><subfield code="n">12</subfield><subfield code="d">2009</subfield><subfield code="c">Berkeley, Calif.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16177950-5</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-03684-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science</subfield><subfield code="v">5687</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">5687</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-03685-9</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</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="940" ind1="1" ind2=" "><subfield code="q">UBR Paketkauf 2024</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2009</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017748837</subfield></datafield></record></collection> |
genre | 1\p (DE-588)1071861417 Konferenzschrift 2009 Berkeley Calif. gnd-content |
genre_facet | Konferenzschrift 2009 Berkeley Calif. |
id | DE-604.BV035694816 |
illustrated | Not Illustrated |
indexdate | 2025-01-15T13:00:51Z |
institution | BVB |
institution_GND | (DE-588)16177950-5 |
isbn | 9783642036859 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017748837 |
oclc_num | 1074138583 |
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-703 DE-706 DE-634 DE-355 DE-BY-UBR |
owner_facet | DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-703 DE-706 DE-634 DE-355 DE-BY-UBR |
physical | 1 Online-Ressource (XII, 740 S.) |
psigel | ZDB-2-LNC ZDB-2-SCS UBR Paketkauf 2024 ZDB-2-SCS_2009 |
publishDate | 2009 |
publishDateSearch | 2009 |
publishDateSort | 2009 |
publisher | Springer |
record_format | marc |
series | Lecture Notes in Computer Science |
series2 | Lecture Notes in Computer Science |
spelling | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Irit Dinur ... (eds.) Berlin [u.a.] Springer 2009 1 Online-Ressource (XII, 740 S.) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Computer Science 5687 Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Randomisierung (DE-588)4280827-3 gnd rswk-swf 1\p (DE-588)1071861417 Konferenzschrift 2009 Berkeley Calif. gnd-content Approximationsalgorithmus (DE-588)4500954-5 s Randomisierung (DE-588)4280827-3 s 2\p DE-604 Kombinatorische Optimierung (DE-588)4031826-6 s 3\p DE-604 Dinur, Irut Sonstige oth APPROX 12 2009 Berkeley, Calif. Sonstige (DE-588)16177950-5 oth Erscheint auch als Druck-Ausgabe, Paperback 978-3-642-03684-2 Lecture Notes in Computer Science 5687 (DE-604)BV014880109 5687 https://doi.org/10.1007/978-3-642-03685-9 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Lecture Notes in Computer Science Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
subject_GND | (DE-588)4500954-5 (DE-588)4031826-6 (DE-588)4280827-3 (DE-588)1071861417 |
title | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |
title_auth | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |
title_exact_search | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |
title_full | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Irit Dinur ... (eds.) |
title_fullStr | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Irit Dinur ... (eds.) |
title_full_unstemmed | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Irit Dinur ... (eds.) |
title_short | Approximation, randomization, and combinatorial optimization |
title_sort | approximation randomization and combinatorial optimization algorithms and techniques 12th international workshop approx 2009 and 13th international workshop random 2009 berkeley ca usa august 21 23 2009 proceedings |
title_sub | algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |
topic | Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
topic_facet | Approximationsalgorithmus Kombinatorische Optimierung Randomisierung Konferenzschrift 2009 Berkeley Calif. |
url | https://doi.org/10.1007/978-3-642-03685-9 |
volume_link | (DE-604)BV014880109 |
work_keys_str_mv | AT dinurirut approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques12thinternationalworkshopapprox2009and13thinternationalworkshoprandom2009berkeleycausaaugust21232009proceedings AT approxberkeleycalif approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques12thinternationalworkshopapprox2009and13thinternationalworkshoprandom2009berkeleycausaaugust21232009proceedings |