A faster combinatorial approximation algorithm for scheduling unrelated parallel machines:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2005
|
| Online-Zugang: | kostenfrei |
| Beschreibung: | In: Automata, languages and programming. - Berlin [u.a.] : Springer, 2005 |
| Beschreibung: | 1 Online-Ressource (S. [828] - 839) |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036744169 | ||
| 003 | DE-604 | ||
| 005 | 20210409 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 101027s2005 |||| o||u| ||||||eng d | ||
| 035 | |a (OCoLC)705933294 | ||
| 035 | |a (DE-599)BVBBV036744169 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 | ||
| 100 | 1 | |a Gairing, Martin |e Verfasser |0 (DE-588)134054059 |4 aut | |
| 245 | 1 | 0 | |a A faster combinatorial approximation algorithm for scheduling unrelated parallel machines |c Martin Gairing ; Burkhard Monien ; Andreas Woclaw |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2005 | |
| 300 | |a 1 Online-Ressource (S. [828] - 839) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a In: Automata, languages and programming. - Berlin [u.a.] : Springer, 2005 | ||
| 700 | 1 | |a Monien, Burkhard |d 1943- |e Verfasser |0 (DE-588)134054849 |4 aut | |
| 700 | 1 | |a Woclaw, Andreas |e Verfasser |4 aut | |
| 776 | 0 | 8 | |i Elektronische Reproduktion |d München : Bayerische Staatsbibliothek, 2011 |o urn:nbn:de:bvb:12-bsb00057413-6 |
| 856 | 4 | 1 | |u http://mdz-nbn-resolving.de/urn:nbn:de:bvb:12-bsb00057413-6 |x Resolving-System |z kostenfrei |3 Volltext // Exemplar mit der Signatur: München, Bibliothek der Technischen Universität -- 0102/DAT 001z 2001 A 999-3580#S.828-839 |
| 912 | |a digit | ||
| 940 | 1 | |q BSBLeibnizPublik | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020661574 | ||
Datensatz im Suchindex
| _version_ | 1804143403159519232 |
|---|---|
| any_adam_object | |
| author | Gairing, Martin Monien, Burkhard 1943- Woclaw, Andreas |
| author_GND | (DE-588)134054059 (DE-588)134054849 |
| author_facet | Gairing, Martin Monien, Burkhard 1943- Woclaw, Andreas |
| author_role | aut aut aut |
| author_sort | Gairing, Martin |
| author_variant | m g mg b m bm a w aw |
| building | Verbundindex |
| bvnumber | BV036744169 |
| collection | digit |
| ctrlnum | (OCoLC)705933294 (DE-599)BVBBV036744169 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01426nmm a2200325 c 4500</leader><controlfield tag="001">BV036744169</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210409 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">101027s2005 |||| o||u| ||||||eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)705933294</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036744169</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="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gairing, Martin</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)134054059</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A faster combinatorial approximation algorithm for scheduling unrelated parallel machines</subfield><subfield code="c">Martin Gairing ; Burkhard Monien ; Andreas Woclaw</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (S. [828] - 839)</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="500" ind1=" " ind2=" "><subfield code="a">In: Automata, languages and programming. - Berlin [u.a.] : Springer, 2005</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Monien, Burkhard</subfield><subfield code="d">1943-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)134054849</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Woclaw, Andreas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Elektronische Reproduktion</subfield><subfield code="d">München : Bayerische Staatsbibliothek, 2011</subfield><subfield code="o">urn:nbn:de:bvb:12-bsb00057413-6</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://mdz-nbn-resolving.de/urn:nbn:de:bvb:12-bsb00057413-6</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext // Exemplar mit der Signatur: München, Bibliothek der Technischen Universität -- 0102/DAT 001z 2001 A 999-3580#S.828-839</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">digit</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">BSBLeibnizPublik</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020661574</subfield></datafield></record></collection> |
| id | DE-604.BV036744169 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T22:47:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020661574 |
| oclc_num | 705933294 |
| open_access_boolean | 1 |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 1 Online-Ressource (S. [828] - 839) |
| psigel | digit BSBLeibnizPublik |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Springer |
| record_format | marc |
| spelling | Gairing, Martin Verfasser (DE-588)134054059 aut A faster combinatorial approximation algorithm for scheduling unrelated parallel machines Martin Gairing ; Burkhard Monien ; Andreas Woclaw Berlin [u.a.] Springer 2005 1 Online-Ressource (S. [828] - 839) txt rdacontent c rdamedia cr rdacarrier In: Automata, languages and programming. - Berlin [u.a.] : Springer, 2005 Monien, Burkhard 1943- Verfasser (DE-588)134054849 aut Woclaw, Andreas Verfasser aut Elektronische Reproduktion München : Bayerische Staatsbibliothek, 2011 urn:nbn:de:bvb:12-bsb00057413-6 http://mdz-nbn-resolving.de/urn:nbn:de:bvb:12-bsb00057413-6 Resolving-System kostenfrei Volltext // Exemplar mit der Signatur: München, Bibliothek der Technischen Universität -- 0102/DAT 001z 2001 A 999-3580#S.828-839 |
| spellingShingle | Gairing, Martin Monien, Burkhard 1943- Woclaw, Andreas A faster combinatorial approximation algorithm for scheduling unrelated parallel machines |
| title | A faster combinatorial approximation algorithm for scheduling unrelated parallel machines |
| title_auth | A faster combinatorial approximation algorithm for scheduling unrelated parallel machines |
| title_exact_search | A faster combinatorial approximation algorithm for scheduling unrelated parallel machines |
| title_full | A faster combinatorial approximation algorithm for scheduling unrelated parallel machines Martin Gairing ; Burkhard Monien ; Andreas Woclaw |
| title_fullStr | A faster combinatorial approximation algorithm for scheduling unrelated parallel machines Martin Gairing ; Burkhard Monien ; Andreas Woclaw |
| title_full_unstemmed | A faster combinatorial approximation algorithm for scheduling unrelated parallel machines Martin Gairing ; Burkhard Monien ; Andreas Woclaw |
| title_short | A faster combinatorial approximation algorithm for scheduling unrelated parallel machines |
| title_sort | a faster combinatorial approximation algorithm for scheduling unrelated parallel machines |
| url | http://mdz-nbn-resolving.de/urn:nbn:de:bvb:12-bsb00057413-6 |
| work_keys_str_mv | AT gairingmartin afastercombinatorialapproximationalgorithmforschedulingunrelatedparallelmachines AT monienburkhard afastercombinatorialapproximationalgorithmforschedulingunrelatedparallelmachines AT woclawandreas afastercombinatorialapproximationalgorithmforschedulingunrelatedparallelmachines |