Approximation, randomization, and combinatorial optimization - algorithms and techniques: 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA
Gespeichert in:
| Körperschaften: | , |
|---|---|
| Weitere beteiligte Personen: | , , , |
| Format: | Elektronisch Tagungsbericht E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Saarbrücken/Wadern
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
August, 2017
|
| Schriftenreihe: | LIPIcs
Vol. 81 |
| Schlagwörter: | |
| Links: | http://drops.dagstuhl.de/opus/volltexte/2017/7710 http://drops.dagstuhl.de/opus/volltexte/2017/7710/pdf/lipics-vol81-approx-random2017-complete.pdf http://drops.dagstuhl.de/portals/extern/index.php?semnr=16040 |
| Beschreibung: | Literaturangaben |
| Umfang: | 1 Online-Ressource Illustrationen |
| ISBN: | 9783959770446 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV044852506 | ||
| 003 | DE-604 | ||
| 005 | 20190717 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180305s2017 xx a||| o|||| 10||| eng d | ||
| 020 | |a 9783959770446 |9 978-3-95977-044-6 | ||
| 024 | 7 | |a urn:nbn:de:0030-drops-77101 |2 urn | |
| 035 | |a (OCoLC)1028536988 | ||
| 035 | |a (DE-599)GBV896283275 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 084 | |a DAT 530f |2 stub | ||
| 084 | |a 54.10 |2 bkl | ||
| 084 | |a 31.76 |2 bkl | ||
| 084 | |a MAT 410f |2 stub | ||
| 084 | |a 31.12 |2 bkl | ||
| 084 | |a MAT 913f |2 stub | ||
| 111 | 2 | |a RANDOM |n 21. |d 2017 |c Berkeley, Calif. |j Verfasser |0 (DE-588)1153832100 |4 aut | |
| 245 | 1 | 0 | |a Approximation, randomization, and combinatorial optimization - algorithms and techniques |b 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA |c edited by Klaus Jansen, José D.P. Rolim, David P. Williamson, Santosh S. Vempala |
| 246 | 1 | 3 | |a APPROX/RANDOM 2017 |
| 246 | 1 | 3 | |a APPROX 2017 |
| 246 | 1 | 3 | |a 20th International Workshop, Approx 2017 |
| 246 | 1 | 3 | |a 21st International Workshop, RANDOM 2017 |
| 246 | 1 | 3 | |a RANDOM 2017 |
| 246 | 1 | 3 | |a Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) |
| 264 | 1 | |a Saarbrücken/Wadern |b Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |c August, 2017 | |
| 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 |v Vol. 81 | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 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 Zufall |0 (DE-588)4068050-2 |2 gnd |9 rswk-swf |
| 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 | |5 DE-604 | |
| 689 | 1 | 0 | |a Zufall |0 (DE-588)4068050-2 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Jansen, Klaus |d 1961- |0 (DE-588)1011509512 |4 edt | |
| 700 | 1 | |a Rolim, José D.P. |d 1956- |0 (DE-588)1089310528 |4 edt | |
| 700 | 1 | |a Williamson, David P. |d 1967- |0 (DE-588)1013297776 |4 edt | |
| 700 | 1 | |a Vempala, Santosh S. |4 edt | |
| 711 | 2 | |a APPROX |n 20. |d 2017 |c Berkeley, Calif. |j Verfasser |0 (DE-588)1153832216 |4 aut | |
| 830 | 0 | |a LIPIcs |v Vol. 81 |w (DE-604)BV039164160 |9 81 | |
| 856 | 4 | 0 | |u http://drops.dagstuhl.de/opus/volltexte/2017/7710 |x Verlag |z kostenfrei |3 Volltext |
| 856 | 4 | 0 | |u http://drops.dagstuhl.de/opus/volltexte/2017/7710/pdf/lipics-vol81-approx-random2017-complete.pdf |x Verlag |z kostenfrei |3 Volltext |
| 856 | 4 | 0 | |u http://drops.dagstuhl.de/portals/extern/index.php?semnr=16040 |x Verlag |z kostenfrei |3 Volltext |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-030247366 | |
Datensatz im Suchindex
| DE-BY-TUM_katkey | 2315006 |
|---|---|
| _version_ | 1821935828492877825 |
| any_adam_object | |
| author2 | Jansen, Klaus 1961- Rolim, José D.P. 1956- Williamson, David P. 1967- Vempala, Santosh S. |
| author2_role | edt edt edt edt |
| author2_variant | k j kj j d r jd jdr d p w dp dpw s s v ss ssv |
| author_GND | (DE-588)1011509512 (DE-588)1089310528 (DE-588)1013297776 |
| author_corporate | RANDOM Berkeley, Calif APPROX |
| author_corporate_role | aut aut |
| author_facet | Jansen, Klaus 1961- Rolim, José D.P. 1956- Williamson, David P. 1967- Vempala, Santosh S. RANDOM Berkeley, Calif APPROX |
| author_sort | RANDOM Berkeley, Calif |
| building | Verbundindex |
| bvnumber | BV044852506 |
| classification_tum | DAT 530f MAT 410f MAT 913f |
| ctrlnum | (OCoLC)1028536988 (DE-599)GBV896283275 |
| discipline | 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>03081nam a2200685 cb4500</leader><controlfield tag="001">BV044852506</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190717 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180305s2017 xx a||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783959770446</subfield><subfield code="9">978-3-95977-044-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">urn:nbn:de:0030-drops-77101</subfield><subfield code="2">urn</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1028536988</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV896283275</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="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.76</subfield><subfield code="2">bkl</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">31.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">RANDOM</subfield><subfield code="n">21.</subfield><subfield code="d">2017</subfield><subfield code="c">Berkeley, Calif.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1153832100</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">20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA</subfield><subfield code="c">edited by Klaus Jansen, José D.P. Rolim, David P. Williamson, Santosh S. Vempala</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">APPROX/RANDOM 2017</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">APPROX 2017</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">20th International Workshop, Approx 2017</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">21st International Workshop, RANDOM 2017</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">RANDOM 2017</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)</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, 2017</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</subfield><subfield code="v">Vol. 81</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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">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">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</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">Jansen, Klaus</subfield><subfield code="d">1961-</subfield><subfield code="0">(DE-588)1011509512</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rolim, José D.P.</subfield><subfield code="d">1956-</subfield><subfield code="0">(DE-588)1089310528</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Williamson, David P.</subfield><subfield code="d">1967-</subfield><subfield code="0">(DE-588)1013297776</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vempala, Santosh S.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">APPROX</subfield><subfield code="n">20.</subfield><subfield code="d">2017</subfield><subfield code="c">Berkeley, Calif.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1153832216</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">LIPIcs</subfield><subfield code="v">Vol. 81</subfield><subfield code="w">(DE-604)BV039164160</subfield><subfield code="9">81</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://drops.dagstuhl.de/opus/volltexte/2017/7710</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://drops.dagstuhl.de/opus/volltexte/2017/7710/pdf/lipics-vol81-approx-random2017-complete.pdf</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://drops.dagstuhl.de/portals/extern/index.php?semnr=16040</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030247366</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV044852506 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T18:12:20Z |
| institution | BVB |
| institution_GND | (DE-588)1153832100 (DE-588)1153832216 |
| isbn | 9783959770446 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030247366 |
| oclc_num | 1028536988 |
| open_access_boolean | 1 |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource Illustrationen |
| publishDate | 2017 |
| publishDateSearch | 2017 |
| publishDateSort | 2017 |
| publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |
| record_format | marc |
| series | LIPIcs |
| series2 | LIPIcs |
| spellingShingle | Approximation, randomization, and combinatorial optimization - algorithms and techniques 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA LIPIcs Algorithmus (DE-588)4001183-5 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Zufall (DE-588)4068050-2 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4500954-5 (DE-588)4031826-6 (DE-588)4068050-2 (DE-588)1071861417 |
| title | Approximation, randomization, and combinatorial optimization - algorithms and techniques 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA |
| title_alt | APPROX/RANDOM 2017 APPROX 2017 20th International Workshop, Approx 2017 21st International Workshop, RANDOM 2017 RANDOM 2017 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) |
| title_auth | Approximation, randomization, and combinatorial optimization - algorithms and techniques 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA |
| title_exact_search | Approximation, randomization, and combinatorial optimization - algorithms and techniques 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA |
| title_full | Approximation, randomization, and combinatorial optimization - algorithms and techniques 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA edited by Klaus Jansen, José D.P. Rolim, David P. Williamson, Santosh S. Vempala |
| title_fullStr | Approximation, randomization, and combinatorial optimization - algorithms and techniques 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA edited by Klaus Jansen, José D.P. Rolim, David P. Williamson, Santosh S. Vempala |
| title_full_unstemmed | Approximation, randomization, and combinatorial optimization - algorithms and techniques 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA edited by Klaus Jansen, José D.P. Rolim, David P. Williamson, Santosh S. Vempala |
| title_short | Approximation, randomization, and combinatorial optimization - algorithms and techniques |
| title_sort | approximation randomization and combinatorial optimization algorithms and techniques 20th international workshop approx 2017 and 21st international workshop random 2017 august 16 18 2017 berkeley ca usa |
| title_sub | 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA |
| topic | Algorithmus (DE-588)4001183-5 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Zufall (DE-588)4068050-2 gnd |
| topic_facet | Algorithmus Approximationsalgorithmus Kombinatorische Optimierung Zufall Konferenzschrift |
| url | http://drops.dagstuhl.de/opus/volltexte/2017/7710 http://drops.dagstuhl.de/opus/volltexte/2017/7710/pdf/lipics-vol81-approx-random2017-complete.pdf http://drops.dagstuhl.de/portals/extern/index.php?semnr=16040 |
| volume_link | (DE-604)BV039164160 |
| work_keys_str_mv | AT randomberkeleycalif approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques20thinternationalworkshopapprox2017and21stinternationalworkshoprandom2017august16182017berkeleycausa AT jansenklaus approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques20thinternationalworkshopapprox2017and21stinternationalworkshoprandom2017august16182017berkeleycausa AT rolimjosedp approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques20thinternationalworkshopapprox2017and21stinternationalworkshoprandom2017august16182017berkeleycausa AT williamsondavidp approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques20thinternationalworkshopapprox2017and21stinternationalworkshoprandom2017august16182017berkeleycausa AT vempalasantoshs approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques20thinternationalworkshopapprox2017and21stinternationalworkshoprandom2017august16182017berkeleycausa AT approxberkeleycalif approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques20thinternationalworkshopapprox2017and21stinternationalworkshoprandom2017august16182017berkeleycausa AT randomberkeleycalif approxrandom2017 AT jansenklaus approxrandom2017 AT rolimjosedp approxrandom2017 AT williamsondavidp approxrandom2017 AT vempalasantoshs approxrandom2017 AT approxberkeleycalif approxrandom2017 AT randomberkeleycalif approx2017 AT jansenklaus approx2017 AT rolimjosedp approx2017 AT williamsondavidp approx2017 AT vempalasantoshs approx2017 AT approxberkeleycalif approx2017 AT randomberkeleycalif 20thinternationalworkshopapprox2017 AT jansenklaus 20thinternationalworkshopapprox2017 AT rolimjosedp 20thinternationalworkshopapprox2017 AT williamsondavidp 20thinternationalworkshopapprox2017 AT vempalasantoshs 20thinternationalworkshopapprox2017 AT approxberkeleycalif 20thinternationalworkshopapprox2017 AT randomberkeleycalif 21stinternationalworkshoprandom2017 AT jansenklaus 21stinternationalworkshoprandom2017 AT rolimjosedp 21stinternationalworkshoprandom2017 AT williamsondavidp 21stinternationalworkshoprandom2017 AT vempalasantoshs 21stinternationalworkshoprandom2017 AT approxberkeleycalif 21stinternationalworkshoprandom2017 AT randomberkeleycalif random2017 AT jansenklaus random2017 AT rolimjosedp random2017 AT williamsondavidp random2017 AT vempalasantoshs random2017 AT approxberkeleycalif random2017 AT randomberkeleycalif approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2017 AT jansenklaus approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2017 AT rolimjosedp approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2017 AT williamsondavidp approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2017 AT vempalasantoshs approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2017 AT approxberkeleycalif approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2017 |