Approximation, randomization, and combinatorial optimization: algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings
Gespeichert in:
| Format: | Elektronisch Tagungsbericht E-Book |
|---|---|
| Sprache: | Undetermined |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2004
|
| Schriftenreihe: | Lecture notes in computer science
3122 |
| Schlagworte: | |
| Online-Zugang: | DE-91 DE-384 DE-19 DE-739 Volltext |
| Beschreibung: | 1 Online-Ressource (IX, 428 S.) graph. Darst. |
| ISBN: | 3540228942 |
| DOI: | 10.1007/b99805 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035049765 | ||
| 003 | DE-604 | ||
| 005 | 20090217 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 080911s2004 xx d||| o|||| 10||| und d | ||
| 020 | |a 3540228942 |9 3-540-22894-2 | ||
| 024 | 7 | |a 10.1007/b99805 |2 doi | |
| 035 | |a (OCoLC)249584703 | ||
| 035 | |a (DE-599)BVBBV035049765 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | |a und | ||
| 049 | |a DE-19 |a DE-91 |a DE-739 |a DE-384 | ||
| 082 | 0 | |a 004.0151 | |
| 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 ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings |c Klaus Jansen ... (eds.) |
| 246 | 1 | 3 | |a APPROX 2004 |
| 246 | 1 | 3 | |a RANDOM 2004 |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2004 | |
| 300 | |a 1 Online-Ressource (IX, 428 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 3122 | |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |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 2004 |z Cambridge Mass. |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |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 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 2 | 1 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Jansen, Klaus |e Sonstige |4 oth | |
| 711 | 2 | |a International Workshop on Approximation Algorithms for Combinatorial Optimization Problems |n 7 |d 2004 |c Cambridge, Mass. |j Sonstige |0 (DE-588)10085353-5 |4 oth | |
| 711 | 2 | |a International Workshop on Randomization and Computation |n 8 |d 2004 |c Cambridge, Mass. |j Sonstige |0 (DE-588)6501847-3 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 3122 |w (DE-604)BV014880109 |9 3122 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/b99805 |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 | |
| 912 | |a ZDB-2-LNC | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-016718468 | |
| 966 | e | |u https://doi.org/10.1007/b99805 |l DE-91 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b99805 |l DE-384 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b99805 |l DE-19 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b99805 |l DE-739 |p ZDB-2-LNC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1820875051279319040 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| building | Verbundindex |
| bvnumber | BV035049765 |
| classification_rvk | SS 4800 |
| classification_tum | MAT 913f DAT 517f |
| collection | ZDB-2-LNC |
| ctrlnum | (OCoLC)249584703 (DE-599)BVBBV035049765 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1007/b99805 |
| 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">BV035049765</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090217</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">080911s2004 xx d||| o|||| 10||| und d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540228942</subfield><subfield code="9">3-540-22894-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/b99805</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)249584703</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035049765</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</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="082" ind1="0" ind2=" "><subfield code="a">004.0151</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 ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings</subfield><subfield code="c">Klaus Jansen ... (eds.)</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">APPROX 2004</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">RANDOM 2004</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (IX, 428 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">3122</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">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">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">2004</subfield><subfield code="z">Cambridge Mass.</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">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">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="8">1\p</subfield><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">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jansen, Klaus</subfield><subfield code="e">Sonstige</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">7</subfield><subfield code="d">2004</subfield><subfield code="c">Cambridge, Mass.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10085353-5</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">International Workshop on Randomization and Computation</subfield><subfield code="n">8</subfield><subfield code="d">2004</subfield><subfield code="c">Cambridge, Mass.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)6501847-3</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">3122</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">3122</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/b99805</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="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-016718468</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b99805</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/b99805</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/b99805</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/b99805</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 2004 Cambridge Mass. gnd-content |
| genre_facet | Konferenzschrift 2004 Cambridge Mass. |
| id | DE-604.BV035049765 |
| illustrated | Illustrated |
| index_date | 2024-07-02T21:56:07Z |
| indexdate | 2025-01-10T15:09:29Z |
| institution | BVB |
| institution_GND | (DE-588)10085353-5 (DE-588)6501847-3 |
| isbn | 3540228942 |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016718468 |
| oclc_num | 249584703 |
| 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, 428 S.) graph. Darst. |
| psigel | ZDB-2-LNC |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| 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 ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings Klaus Jansen ... (eds.) APPROX 2004 RANDOM 2004 Berlin [u.a.] Springer 2004 1 Online-Ressource (IX, 428 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 3122 Approximation (DE-588)4002498-2 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 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 2004 Cambridge Mass. gnd-content Kombinatorische Optimierung (DE-588)4031826-6 s Approximationsalgorithmus (DE-588)4500954-5 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Randomisierung (DE-588)4280827-3 s 1\p DE-604 Approximation (DE-588)4002498-2 s 2\p DE-604 Jansen, Klaus Sonstige oth International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 7 2004 Cambridge, Mass. Sonstige (DE-588)10085353-5 oth International Workshop on Randomization and Computation 8 2004 Cambridge, Mass. Sonstige (DE-588)6501847-3 oth Lecture notes in computer science 3122 (DE-604)BV014880109 3122 https://doi.org/10.1007/b99805 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 |
| spellingShingle | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings Lecture notes in computer science Approximation (DE-588)4002498-2 gnd Approximationsalgorithmus (DE-588)4500954-5 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)4002498-2 (DE-588)4500954-5 (DE-588)4120591-1 (DE-588)4031826-6 (DE-588)4280827-3 (DE-588)1071861417 |
| title | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings |
| title_alt | APPROX 2004 RANDOM 2004 |
| title_auth | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings |
| title_exact_search | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings |
| title_exact_search_txtP | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings |
| title_full | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings Klaus Jansen ... (eds.) |
| title_fullStr | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings Klaus Jansen ... (eds.) |
| title_full_unstemmed | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings Klaus Jansen ... (eds.) |
| title_short | Approximation, randomization, and combinatorial optimization |
| title_sort | approximation randomization and combinatorial optimization algorithms and techniques 7th international workshop on approximation algorithms for combinatorial optimization problems approx 2004 and 8th international workshop on randomization and computation random 2004 cambridge ma usa august 22 24 2004 proceedings |
| title_sub | algorithms and techniques ; 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, Random 2004, Cambridge, MA, USA, August 22 - 24, 2004 ; proceedings |
| topic | Approximation (DE-588)4002498-2 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
| topic_facet | Approximation Approximationsalgorithmus Komplexitätstheorie Kombinatorische Optimierung Randomisierung Konferenzschrift 2004 Cambridge Mass. |
| url | https://doi.org/10.1007/b99805 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT jansenklaus approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques7thinternationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemsapprox2004and8thinternationalworkshoponrandomizationandcomputationrandom2004cambridgemausaaug AT internationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemscambridgemass approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques7thinternationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemsapprox2004and8thinternationalworkshoponrandomizationandcomputationrandom2004cambridgemausaaug AT internationalworkshoponrandomizationandcomputationcambridgemass approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques7thinternationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemsapprox2004and8thinternationalworkshoponrandomizationandcomputationrandom2004cambridgemausaaug AT jansenklaus approx2004 AT internationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemscambridgemass approx2004 AT internationalworkshoponrandomizationandcomputationcambridgemass approx2004 AT jansenklaus random2004 AT internationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemscambridgemass random2004 AT internationalworkshoponrandomizationandcomputationcambridgemass random2004 |