Approximation, randomization, and combinatorial optimization. algorithms and techniques: APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA
Gespeichert in:
Körperschaft: | |
---|---|
Weitere Verfasser: | , |
Format: | Elektronisch Tagungsbericht E-Book |
Sprache: | English |
Veröffentlicht: |
Saarbrücken/Wadern
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
September, 2019
|
Schriftenreihe: | LIPIcs
Vol. 145 |
Schlagworte: | |
Online-Zugang: | https://nbn-resolving.org/urn:nbn:de:0030-drops-113014 http://d-nb.info/1195628544/34 kostenfrei kostenfrei |
Beschreibung: | 1 Online-Ressource Illustrationen, Diagramme |
ISBN: | 9783959771252 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV046302995 | ||
003 | DE-604 | ||
005 | 20200117 | ||
006 | a |||| 10||| | ||
007 | cr|uuu---uuuuu | ||
008 | 191213s2019 gw |||| o||u| ||||||eng d | ||
015 | |a 19,O10 |2 dnb | ||
016 | 7 | |a 1195628544 |2 DE-101 | |
020 | |a 9783959771252 |c Online |9 978-3-95977-125-2 | ||
024 | 7 | |a urn:nbn:de:0030-drops-113014 |2 urn | |
035 | |a (OCoLC)1135426691 | ||
035 | |a (DE-599)DNB1195628544 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE-SL | ||
049 | |a DE-91 |a DE-384 | ||
084 | |a SK 905 |0 (DE-625)143269: |2 rvk | ||
084 | |a 510 |2 sdnb | ||
084 | |a 519.6 |2 sdnb | ||
111 | 2 | |a APPROX |n 22. |d 2019 |c Cambridge, Mass. |j Verfasser |0 (DE-588)1195227604 |4 aut | |
245 | 1 | 0 | |a Approximation, randomization, and combinatorial optimization. algorithms and techniques |b APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA |c edited by Dimitris Achlioptas, László A. Végh |
264 | 1 | |a Saarbrücken/Wadern |b Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |c September, 2019 | |
300 | |a 1 Online-Ressource |b Illustrationen, Diagramme | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a LIPIcs |v Vol. 145 | |
583 | 1 | |a Archivierung/Langzeitarchivierung gewährleistet |5 DE-101 |2 pdager | |
653 | |a Mathematics of computing; Theory of computation | ||
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
700 | 1 | |a Achlioptas, Dimitris |4 edt | |
700 | 1 | |a Végh, László A. |4 edt | |
830 | 0 | |a LIPIcs |v Vol. 145 |w (DE-604)BV039164160 |9 145 | |
856 | 4 | 0 | |u https://nbn-resolving.org/urn:nbn:de:0030-drops-113014 |x Resolving-System |
856 | 4 | 0 | |u http://d-nb.info/1195628544/34 |x Langzeitarchivierung Nationalbibliothek |
856 | 4 | 0 | |u http://www.dagstuhl.de/dagpub/978-3-95977-125-2 |x Verlag |z kostenfrei |
856 | 4 | 0 | |u https://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol145-approx-random2019-complete.pdf |x Verlag |z kostenfrei |3 Volltext |
999 | |a oai:aleph.bib-bvb.de:BVB01-031680269 |
Datensatz im Suchindex
_version_ | 1804180774228852736 |
---|---|
any_adam_object | |
author2 | Achlioptas, Dimitris Végh, László A. |
author2_role | edt edt |
author2_variant | d a da l a v la lav |
author_corporate | APPROX Cambridge, Mass |
author_corporate_role | aut |
author_facet | Achlioptas, Dimitris Végh, László A. APPROX Cambridge, Mass |
author_sort | APPROX Cambridge, Mass |
building | Verbundindex |
bvnumber | BV046302995 |
classification_rvk | SK 905 |
ctrlnum | (OCoLC)1135426691 (DE-599)DNB1195628544 |
discipline | Mathematik |
format | Electronic Conference Proceeding eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02139nmm a2200481zcb4500</leader><controlfield tag="001">BV046302995</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200117 </controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">191213s2019 gw |||| o||u| ||||||eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">19,O10</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1195628544</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783959771252</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-95977-125-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">urn:nbn:de:0030-drops-113014</subfield><subfield code="2">urn</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1135426691</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1195628544</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</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-SL</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 905</subfield><subfield code="0">(DE-625)143269:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">519.6</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">APPROX</subfield><subfield code="n">22.</subfield><subfield code="d">2019</subfield><subfield code="c">Cambridge, Mass.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1195227604</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation, randomization, and combinatorial optimization. algorithms and techniques</subfield><subfield code="b">APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA</subfield><subfield code="c">edited by Dimitris Achlioptas, László A. Végh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Saarbrücken/Wadern</subfield><subfield code="b">Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing</subfield><subfield code="c">September, 2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</subfield><subfield code="b">Illustrationen, Diagramme</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">LIPIcs</subfield><subfield code="v">Vol. 145</subfield></datafield><datafield tag="583" ind1="1" ind2=" "><subfield code="a">Archivierung/Langzeitarchivierung gewährleistet</subfield><subfield code="5">DE-101</subfield><subfield code="2">pdager</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematics of computing; Theory of computation</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Achlioptas, Dimitris</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Végh, László A.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">LIPIcs</subfield><subfield code="v">Vol. 145</subfield><subfield code="w">(DE-604)BV039164160</subfield><subfield code="9">145</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:0030-drops-113014</subfield><subfield code="x">Resolving-System</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://d-nb.info/1195628544/34</subfield><subfield code="x">Langzeitarchivierung Nationalbibliothek</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.dagstuhl.de/dagpub/978-3-95977-125-2</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol145-approx-random2019-complete.pdf</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031680269</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift gnd-content |
genre_facet | Konferenzschrift |
id | DE-604.BV046302995 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T08:41:06Z |
institution | BVB |
institution_GND | (DE-588)1195227604 |
isbn | 9783959771252 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031680269 |
oclc_num | 1135426691 |
open_access_boolean | 1 |
owner | DE-91 DE-BY-TUM DE-384 |
owner_facet | DE-91 DE-BY-TUM DE-384 |
physical | 1 Online-Ressource Illustrationen, Diagramme |
publishDate | 2019 |
publishDateSearch | 2019 |
publishDateSort | 2019 |
publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |
record_format | marc |
series | LIPIcs |
series2 | LIPIcs |
spelling | APPROX 22. 2019 Cambridge, Mass. Verfasser (DE-588)1195227604 aut Approximation, randomization, and combinatorial optimization. algorithms and techniques APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA edited by Dimitris Achlioptas, László A. Végh Saarbrücken/Wadern Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing September, 2019 1 Online-Ressource Illustrationen, Diagramme txt rdacontent c rdamedia cr rdacarrier LIPIcs Vol. 145 Archivierung/Langzeitarchivierung gewährleistet DE-101 pdager Mathematics of computing; Theory of computation (DE-588)1071861417 Konferenzschrift gnd-content Achlioptas, Dimitris edt Végh, László A. edt LIPIcs Vol. 145 (DE-604)BV039164160 145 https://nbn-resolving.org/urn:nbn:de:0030-drops-113014 Resolving-System http://d-nb.info/1195628544/34 Langzeitarchivierung Nationalbibliothek http://www.dagstuhl.de/dagpub/978-3-95977-125-2 Verlag kostenfrei https://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol145-approx-random2019-complete.pdf Verlag kostenfrei Volltext |
spellingShingle | Approximation, randomization, and combinatorial optimization. algorithms and techniques APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA LIPIcs |
subject_GND | (DE-588)1071861417 |
title | Approximation, randomization, and combinatorial optimization. algorithms and techniques APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA |
title_auth | Approximation, randomization, and combinatorial optimization. algorithms and techniques APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA |
title_exact_search | Approximation, randomization, and combinatorial optimization. algorithms and techniques APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA |
title_full | Approximation, randomization, and combinatorial optimization. algorithms and techniques APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA edited by Dimitris Achlioptas, László A. Végh |
title_fullStr | Approximation, randomization, and combinatorial optimization. algorithms and techniques APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA edited by Dimitris Achlioptas, László A. Végh |
title_full_unstemmed | Approximation, randomization, and combinatorial optimization. algorithms and techniques APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA edited by Dimitris Achlioptas, László A. Végh |
title_short | Approximation, randomization, and combinatorial optimization. algorithms and techniques |
title_sort | approximation randomization and combinatorial optimization algorithms and techniques approx random 2019 september 20 22 2019 massachusetts institute of technology cambridge ma usa |
title_sub | APPROX/RANDOM 2019, September 20–22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA |
topic_facet | Konferenzschrift |
url | https://nbn-resolving.org/urn:nbn:de:0030-drops-113014 http://d-nb.info/1195628544/34 http://www.dagstuhl.de/dagpub/978-3-95977-125-2 https://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol145-approx-random2019-complete.pdf |
volume_link | (DE-604)BV039164160 |
work_keys_str_mv | AT approxcambridgemass approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2019september20222019massachusettsinstituteoftechnologycambridgemausa AT achlioptasdimitris approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2019september20222019massachusettsinstituteoftechnologycambridgemausa AT veghlaszloa approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2019september20222019massachusettsinstituteoftechnologycambridgemausa |