Approximation, randomization and combinatorial optimization: algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings
Gespeichert in:
| Format: | Elektronisch Tagungsbericht E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London
Springer
2001
|
| Schriftenreihe: | Lecture notes in computer science
2129 |
| Schlagworte: | |
| Online-Zugang: | DE-91 DE-384 DE-19 DE-739 Volltext |
| Beschreibung: | Literaturangaben |
| Beschreibung: | 1 Online-Ressource (IX, 296 S. graph. Darst.) |
| ISBN: | 3540424709 3540446664 |
| DOI: | 10.1007/3-540-44666-4 |
Internformat
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV035246118 | ||
| 003 | DE-604 | ||
| 005 | 20090217 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 090114s2001 gw d||| o|||| 10||| eng d | ||
| 020 | |a 3540424709 |9 3-540-42470-9 | ||
| 020 | |a 3540446664 |c Online |9 3-540-44666-4 | ||
| 024 | 7 | |a 10.1007/3-540-44666-4 |2 doi | |
| 035 | |a (OCoLC)699828903 | ||
| 035 | |a (DE-599)BVBBV035246118 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-19 |a DE-91 |a DE-739 |a DE-384 | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 913f |2 stub | ||
| 084 | |a DAT 517f |2 stub | ||
| 245 | 1 | 0 | |a Approximation, randomization and combinatorial optimization |b algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings |c Michel Goemans ... (ed.) |
| 264 | 1 | |a Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London |b Springer |c 2001 | |
| 300 | |a 1 Online-Ressource (IX, 296 S. |b graph. Darst.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 2129 | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |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 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2001 |z Berkeley Calif. |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 1 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 1 | 2 | |a Randomisierung |0 (DE-588)4280827-3 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 2 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 2 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Goemans, Michel X. |d 1964- |e Sonstige |0 (DE-588)171721543 |4 oth | |
| 711 | 2 | |a International Workshop on Approximation Algorithms for Combinatorial Optimization Problems |n 4 |d 2001 |c Berkeley, Calif. |j Sonstige |0 (DE-588)10024242-X |4 oth | |
| 711 | 2 | |a International Workshop on Randomization and Approximation Techniques in Computer Science |n 5 |d 2001 |c Berkeley, Calif. |j Sonstige |0 (DE-588)5530360-2 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 2129 |w (DE-604)BV014880109 |9 2129 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/3-540-44666-4 |x Verlag |3 Volltext |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 912 | |a ZDB-2-LNC | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017051833 | |
| 966 | e | |u https://doi.org/10.1007/3-540-44666-4 |l DE-91 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-44666-4 |l DE-384 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-44666-4 |l DE-19 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-44666-4 |l DE-739 |p ZDB-2-LNC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1820875107006939136 |
|---|---|
| adam_text | |
| any_adam_object | |
| author_GND | (DE-588)171721543 |
| building | Verbundindex |
| bvnumber | BV035246118 |
| classification_rvk | SK 890 |
| classification_tum | MAT 913f DAT 517f |
| collection | ZDB-2-LNC |
| ctrlnum | (OCoLC)699828903 (DE-599)BVBBV035246118 |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1007/3-540-44666-4 |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000008cb4500</leader><controlfield tag="001">BV035246118</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090217</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">090114s2001 gw d||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540424709</subfield><subfield code="9">3-540-42470-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540446664</subfield><subfield code="c">Online</subfield><subfield code="9">3-540-44666-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/3-540-44666-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)699828903</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035246118</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</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 517f</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 ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings</subfield><subfield code="c">Michel Goemans ... (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (IX, 296 S.</subfield><subfield code="b">graph. Darst.)</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">2129</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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">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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2001</subfield><subfield code="z">Berkeley Calif.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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="2"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</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="1"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goemans, Michel X.</subfield><subfield code="d">1964-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)171721543</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">International Workshop on Approximation Algorithms for Combinatorial Optimization Problems</subfield><subfield code="n">4</subfield><subfield code="d">2001</subfield><subfield code="c">Berkeley, Calif.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10024242-X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">International Workshop on Randomization and Approximation Techniques in Computer Science</subfield><subfield code="n">5</subfield><subfield code="d">2001</subfield><subfield code="c">Berkeley, Calif.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)5530360-2</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">2129</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">2129</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/3-540-44666-4</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="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017051833</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-44666-4</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-44666-4</subfield><subfield code="l">DE-384</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-44666-4</subfield><subfield code="l">DE-19</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-44666-4</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2001 Berkeley Calif. gnd-content |
| genre_facet | Konferenzschrift 2001 Berkeley Calif. |
| id | DE-604.BV035246118 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:10:22Z |
| institution | BVB |
| institution_GND | (DE-588)10024242-X (DE-588)5530360-2 |
| isbn | 3540424709 3540446664 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017051833 |
| oclc_num | 699828903 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 |
| owner_facet | DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 |
| physical | 1 Online-Ressource (IX, 296 S. graph. Darst.) |
| psigel | ZDB-2-LNC |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| 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 ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings Michel Goemans ... (ed.) Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London Springer 2001 1 Online-Ressource (IX, 296 S. graph. Darst.) txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 2129 Literaturangaben Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Randomisierung (DE-588)4280827-3 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2001 Berkeley Calif. gnd-content Kombinatorische Optimierung (DE-588)4031826-6 s Approximation (DE-588)4002498-2 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Approximationsalgorithmus (DE-588)4500954-5 s Randomisierung (DE-588)4280827-3 s 1\p DE-604 Goemans, Michel X. 1964- Sonstige (DE-588)171721543 oth International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 4 2001 Berkeley, Calif. Sonstige (DE-588)10024242-X oth International Workshop on Randomization and Approximation Techniques in Computer Science 5 2001 Berkeley, Calif. Sonstige (DE-588)5530360-2 oth Lecture notes in computer science 2129 (DE-604)BV014880109 2129 https://doi.org/10.1007/3-540-44666-4 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Approximation, randomization and combinatorial optimization algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings Lecture notes in computer science Approximationsalgorithmus (DE-588)4500954-5 gnd Approximation (DE-588)4002498-2 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4002498-2 (DE-588)4120591-1 (DE-588)4031826-6 (DE-588)4280827-3 (DE-588)1071861417 |
| title | Approximation, randomization and combinatorial optimization algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings |
| title_auth | Approximation, randomization and combinatorial optimization algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings |
| title_exact_search | Approximation, randomization and combinatorial optimization algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings |
| title_full | Approximation, randomization and combinatorial optimization algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings Michel Goemans ... (ed.) |
| title_fullStr | Approximation, randomization and combinatorial optimization algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings Michel Goemans ... (ed.) |
| title_full_unstemmed | Approximation, randomization and combinatorial optimization algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings Michel Goemans ... (ed.) |
| title_short | Approximation, randomization and combinatorial optimization |
| title_sort | approximation randomization and combinatorial optimization algorithms and techniques 4th international workshop on approximation algorithms for combinatorial optimization problems approx 2001 and 5th international workshop on randomization and approximation techniques in computer science random 2001 berkeley ca usa august 18 20 2001 proceedings |
| title_sub | algorithms and techniques ; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18 - 20, 2001 ; proceedings |
| topic | Approximationsalgorithmus (DE-588)4500954-5 gnd Approximation (DE-588)4002498-2 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
| topic_facet | Approximationsalgorithmus Approximation Komplexitätstheorie Kombinatorische Optimierung Randomisierung Konferenzschrift 2001 Berkeley Calif. |
| url | https://doi.org/10.1007/3-540-44666-4 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT goemansmichelx approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques4thinternationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemsapprox2001and5thinternationalworkshoponrandomizationandapproximationtechniquesincomputerscien AT internationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemsberkeleycalif approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques4thinternationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemsapprox2001and5thinternationalworkshoponrandomizationandapproximationtechniquesincomputerscien AT internationalworkshoponrandomizationandapproximationtechniquesincomputerscienceberkeleycalif approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques4thinternationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemsapprox2001and5thinternationalworkshoponrandomizationandapproximationtechniquesincomputerscien |