Parallel approximation algorithms for bin packing:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
1988
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1200 |
| Schlagwörter: | |
| Umfang: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009227386 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940313s1988 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)19273354 | ||
| 035 | |a (DE-599)BVBBV009227386 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76 | |
| 100 | 1 | |a Anderson, Richard J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel approximation algorithms for bin packing |c by R. J. Anderson, E. W. Mayr, and M. K. Warmuth |
| 264 | 1 | |a Stanford, Calif. |c 1988 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1200 | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Packungsproblem |0 (DE-588)4173057-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Packungsproblem |0 (DE-588)4173057-4 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Mayr, Ernst W. |d 1950- |e Verfasser |0 (DE-588)109817923 |4 aut | |
| 700 | 1 | |a Warmuth, Manfred K. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1200 |w (DE-604)BV008928280 |9 1200 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006136076 | |
Datensatz im Suchindex
| _version_ | 1818951446922526720 |
|---|---|
| any_adam_object | |
| author | Anderson, Richard J. Mayr, Ernst W. 1950- Warmuth, Manfred K. |
| author_GND | (DE-588)109817923 |
| author_facet | Anderson, Richard J. Mayr, Ernst W. 1950- Warmuth, Manfred K. |
| author_role | aut aut aut |
| author_sort | Anderson, Richard J. |
| author_variant | r j a rj rja e w m ew ewm m k w mk mkw |
| building | Verbundindex |
| bvnumber | BV009227386 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)19273354 (DE-599)BVBBV009227386 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01550nam a2200421 cb4500</leader><controlfield tag="001">BV009227386</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940313s1988 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19273354</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009227386</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="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Anderson, Richard J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel approximation algorithms for bin packing</subfield><subfield code="c">by R. J. Anderson, E. W. Mayr, and M. K. Warmuth</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1200</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</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">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Packungsproblem</subfield><subfield code="0">(DE-588)4173057-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Packungsproblem</subfield><subfield code="0">(DE-588)4173057-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="2"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-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">Mayr, Ernst W.</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109817923</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Warmuth, Manfred K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1200</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1200</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006136076</subfield></datafield></record></collection> |
| id | DE-604.BV009227386 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:34:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006136076 |
| oclc_num | 19273354 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 14 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Anderson, Richard J. Verfasser aut Parallel approximation algorithms for bin packing by R. J. Anderson, E. W. Mayr, and M. K. Warmuth Stanford, Calif. 1988 14 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1200 Algorithms Computational complexity Parallel processing (Electronic computers) Algorithmus (DE-588)4001183-5 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Packungsproblem (DE-588)4173057-4 gnd rswk-swf Packungsproblem (DE-588)4173057-4 s Algorithmus (DE-588)4001183-5 s Parallelverarbeitung (DE-588)4075860-6 s DE-604 Mayr, Ernst W. 1950- Verfasser (DE-588)109817923 aut Warmuth, Manfred K. Verfasser aut Computer Science Department: Report STAN-CS Stanford University 1200 (DE-604)BV008928280 1200 |
| spellingShingle | Anderson, Richard J. Mayr, Ernst W. 1950- Warmuth, Manfred K. Parallel approximation algorithms for bin packing Algorithms Computational complexity Parallel processing (Electronic computers) Algorithmus (DE-588)4001183-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Packungsproblem (DE-588)4173057-4 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4075860-6 (DE-588)4173057-4 |
| title | Parallel approximation algorithms for bin packing |
| title_auth | Parallel approximation algorithms for bin packing |
| title_exact_search | Parallel approximation algorithms for bin packing |
| title_full | Parallel approximation algorithms for bin packing by R. J. Anderson, E. W. Mayr, and M. K. Warmuth |
| title_fullStr | Parallel approximation algorithms for bin packing by R. J. Anderson, E. W. Mayr, and M. K. Warmuth |
| title_full_unstemmed | Parallel approximation algorithms for bin packing by R. J. Anderson, E. W. Mayr, and M. K. Warmuth |
| title_short | Parallel approximation algorithms for bin packing |
| title_sort | parallel approximation algorithms for bin packing |
| topic | Algorithms Computational complexity Parallel processing (Electronic computers) Algorithmus (DE-588)4001183-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Packungsproblem (DE-588)4173057-4 gnd |
| topic_facet | Algorithms Computational complexity Parallel processing (Electronic computers) Algorithmus Parallelverarbeitung Packungsproblem |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT andersonrichardj parallelapproximationalgorithmsforbinpacking AT mayrernstw parallelapproximationalgorithmsforbinpacking AT warmuthmanfredk parallelapproximationalgorithmsforbinpacking |