Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference
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
August, 2020
|
| Schriftenreihe: | LIPIcs - Leibniz International Proceedings in Informatics
Vol. 176 |
| Schlagworte: | |
| Online-Zugang: | https://nbn-resolving.org/urn:nbn:de:0030-drops-126021 https://d-nb.info/1216343942/34 kostenfrei Volltext |
| Beschreibung: | 1 Online-Ressource Illustrationen |
| ISBN: | 9783959771641 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV047086027 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 006 | a |||| 10||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 210113s2020 gw |||| o||u| ||||||eng d | ||
| 015 | |a 20,O09 |2 dnb | ||
| 016 | 7 | |a 1216343942 |2 DE-101 | |
| 020 | |a 9783959771641 |9 978-3-95977-164-1 | ||
| 024 | 7 | |a urn:nbn:de:0030-drops-126021 |2 urn | |
| 035 | |a (OCoLC)1231967483 | ||
| 035 | |a (DE-599)DNB1216343942 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-SL | ||
| 049 | |a DE-91 | ||
| 084 | |a DAT 530 |2 stub | ||
| 084 | |8 2\p |a 510 |2 23sdnb | ||
| 084 | |a MAT 913 |2 stub | ||
| 084 | |a MAT 410 |2 stub | ||
| 084 | |8 1\p |a 519.6 |2 23ksdnb | ||
| 111 | 2 | |a APPROX |n 23. |d 2020 |c Online |j Verfasser |0 (DE-588)1219687758 |4 aut | |
| 245 | 1 | 0 | |a Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques |b APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference |c edited by Jarosław Byrka, Raghu Meka |
| 264 | 1 | |a Saarbrücken/Wadern |b Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |c August, 2020 | |
| 300 | |a 1 Online-Ressource |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a LIPIcs - Leibniz International Proceedings in Informatics |v Vol. 176 | |
| 583 | 1 | |a Archivierung/Langzeitarchivierung gewährleistet |5 DE-101 |2 pdager | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-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 Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zufall |0 (DE-588)4068050-2 |2 gnd |9 rswk-swf |
| 653 | |a LIPIcs, Volume 176, APPROX/RANDOM 2020, Complete Volume | ||
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | 1 | |a Zufall |0 (DE-588)4068050-2 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 3 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Byrka, Jarosław |4 edt | |
| 700 | 1 | |a Meka, Raghu |4 edt | |
| 711 | 2 | |a RANDOM |n 24. |d 2020 |c Online |j Sonstige |0 (DE-588)1219688347 |4 oth | |
| 830 | 0 | |a LIPIcs - Leibniz International Proceedings in Informatics |v Vol. 176 |w (DE-604)BV039164160 |9 176 | |
| 856 | 4 | 0 | |u https://nbn-resolving.org/urn:nbn:de:0030-drops-126021 |x Resolving-System |
| 856 | 4 | 0 | |u https://d-nb.info/1216343942/34 |x Langzeitarchivierung Nationalbibliothek |
| 856 | 4 | 0 | |u https://www.dagstuhl.de/dagpub/978-3-95977-164-1 |x Verlag |z kostenfrei |
| 856 | 4 | 0 | |u https://drops.dagstuhl.de/opus/volltexte/2020/12602/pdf/lipics-vol176-approx-random2020-complete.pdf |x Verlag |z kostenfrei |3 Volltext |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032492725 | ||
| 883 | 0 | |8 1\p |a aep-kn |c 0,99726 |d 20200822 |q DE-101 |u https://d-nb.info/provenance/plan#aep-kn | |
| 883 | 0 | |8 2\p |a aep-sg |c 0,99770 |d 20200822 |q DE-101 |u https://d-nb.info/provenance/plan#aep-sg | |
Datensatz im Suchindex
| _version_ | 1804182100179419136 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author2 | Byrka, Jarosław Meka, Raghu |
| author2_role | edt edt |
| author2_variant | j b jb r m rm |
| author_corporate | APPROX Online |
| author_corporate_role | aut |
| author_facet | Byrka, Jarosław Meka, Raghu APPROX Online |
| author_sort | APPROX Online |
| building | Verbundindex |
| bvnumber | BV047086027 |
| classification_tum | DAT 530 MAT 913 MAT 410 |
| ctrlnum | (OCoLC)1231967483 (DE-599)DNB1216343942 |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02998nmm a2200649zcb4500</leader><controlfield tag="001">BV047086027</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210113s2020 gw |||| o||u| ||||||eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">20,O09</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1216343942</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783959771641</subfield><subfield code="9">978-3-95977-164-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">urn:nbn:de:0030-drops-126021</subfield><subfield code="2">urn</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1231967483</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1216343942</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></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="8">2\p</subfield><subfield code="a">510</subfield><subfield code="2">23sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 410</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="8">1\p</subfield><subfield code="a">519.6</subfield><subfield code="2">23ksdnb</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">APPROX</subfield><subfield code="n">23.</subfield><subfield code="d">2020</subfield><subfield code="c">Online</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1219687758</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 2020, August 17–19, 2020, Virtual Conference</subfield><subfield code="c">edited by Jarosław Byrka, Raghu Meka</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">August, 2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</subfield><subfield code="b">Illustrationen</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 - Leibniz International Proceedings in Informatics</subfield><subfield code="v">Vol. 176</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="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="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">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">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">LIPIcs, Volume 176, APPROX/RANDOM 2020, Complete Volume</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="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">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="3"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</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">Byrka, Jarosław</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meka, Raghu</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">RANDOM</subfield><subfield code="n">24.</subfield><subfield code="d">2020</subfield><subfield code="c">Online</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1219688347</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">LIPIcs - Leibniz International Proceedings in Informatics</subfield><subfield code="v">Vol. 176</subfield><subfield code="w">(DE-604)BV039164160</subfield><subfield code="9">176</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:0030-drops-126021</subfield><subfield code="x">Resolving-System</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://d-nb.info/1216343942/34</subfield><subfield code="x">Langzeitarchivierung Nationalbibliothek</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.dagstuhl.de/dagpub/978-3-95977-164-1</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/2020/12602/pdf/lipics-vol176-approx-random2020-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-032492725</subfield></datafield><datafield tag="883" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">aep-kn</subfield><subfield code="c">0,99726</subfield><subfield code="d">20200822</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#aep-kn</subfield></datafield><datafield tag="883" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">aep-sg</subfield><subfield code="c">0,99770</subfield><subfield code="d">20200822</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#aep-sg</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV047086027 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:17:51Z |
| indexdate | 2024-07-10T09:02:11Z |
| institution | BVB |
| institution_GND | (DE-588)1219687758 (DE-588)1219688347 |
| isbn | 9783959771641 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032492725 |
| oclc_num | 1231967483 |
| open_access_boolean | 1 |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource Illustrationen |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |
| record_format | marc |
| series | LIPIcs - Leibniz International Proceedings in Informatics |
| series2 | LIPIcs - Leibniz International Proceedings in Informatics |
| spelling | APPROX 23. 2020 Online Verfasser (DE-588)1219687758 aut Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference edited by Jarosław Byrka, Raghu Meka Saarbrücken/Wadern Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing August, 2020 1 Online-Ressource Illustrationen txt rdacontent c rdamedia cr rdacarrier LIPIcs - Leibniz International Proceedings in Informatics Vol. 176 Archivierung/Langzeitarchivierung gewährleistet DE-101 pdager Algorithmus (DE-588)4001183-5 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Zufall (DE-588)4068050-2 gnd rswk-swf LIPIcs, Volume 176, APPROX/RANDOM 2020, Complete Volume (DE-588)1071861417 Konferenzschrift gnd-content Approximationsalgorithmus (DE-588)4500954-5 s Zufall (DE-588)4068050-2 s Algorithmus (DE-588)4001183-5 s Kombinatorische Optimierung (DE-588)4031826-6 s DE-604 Byrka, Jarosław edt Meka, Raghu edt RANDOM 24. 2020 Online Sonstige (DE-588)1219688347 oth LIPIcs - Leibniz International Proceedings in Informatics Vol. 176 (DE-604)BV039164160 176 https://nbn-resolving.org/urn:nbn:de:0030-drops-126021 Resolving-System https://d-nb.info/1216343942/34 Langzeitarchivierung Nationalbibliothek https://www.dagstuhl.de/dagpub/978-3-95977-164-1 Verlag kostenfrei https://drops.dagstuhl.de/opus/volltexte/2020/12602/pdf/lipics-vol176-approx-random2020-complete.pdf Verlag kostenfrei Volltext 1\p aep-kn 0,99726 20200822 DE-101 https://d-nb.info/provenance/plan#aep-kn 2\p aep-sg 0,99770 20200822 DE-101 https://d-nb.info/provenance/plan#aep-sg |
| spellingShingle | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference LIPIcs - Leibniz International Proceedings in Informatics Algorithmus (DE-588)4001183-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Zufall (DE-588)4068050-2 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4031826-6 (DE-588)4500954-5 (DE-588)4068050-2 (DE-588)1071861417 |
| title | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference |
| title_auth | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference |
| title_exact_search | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference |
| title_exact_search_txtP | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference |
| title_full | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference edited by Jarosław Byrka, Raghu Meka |
| title_fullStr | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference edited by Jarosław Byrka, Raghu Meka |
| title_full_unstemmed | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference edited by Jarosław Byrka, Raghu Meka |
| title_short | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques |
| title_sort | approximation randomization and combinatorial optimization algorithms and techniques approx random 2020 august 17 19 2020 virtual conference |
| title_sub | APPROX/RANDOM 2020, August 17–19, 2020, Virtual Conference |
| topic | Algorithmus (DE-588)4001183-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Zufall (DE-588)4068050-2 gnd |
| topic_facet | Algorithmus Kombinatorische Optimierung Approximationsalgorithmus Zufall Konferenzschrift |
| url | https://nbn-resolving.org/urn:nbn:de:0030-drops-126021 https://d-nb.info/1216343942/34 https://www.dagstuhl.de/dagpub/978-3-95977-164-1 https://drops.dagstuhl.de/opus/volltexte/2020/12602/pdf/lipics-vol176-approx-random2020-complete.pdf |
| volume_link | (DE-604)BV039164160 |
| work_keys_str_mv | AT approxonline approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2020august17192020virtualconference AT byrkajarosław approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2020august17192020virtualconference AT mekaraghu approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2020august17192020virtualconference AT randomonline approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2020august17192020virtualconference |