Tight approximations for resource constrained scheduling and bin packing:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Berlin
Freie Univ., Fachbereich Mathematik
1995
|
| Schriftenreihe: | Freie Universität Berlin, Fachbereich Mathematik
Ser. B, Informatik ; 95,18 |
| Beschreibung: | 36 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV026951540 | ||
| 003 | DE-604 | ||
| 005 | 20110228 | ||
| 007 | t | ||
| 008 | 110326s1995 d||| |||| 00||| und d | ||
| 015 | |a 96,B24,0301 |2 dnb | ||
| 016 | 7 | |a 94.749893.1 |2 DE-101 | |
| 035 | |a (OCoLC)75724508 | ||
| 035 | |a (DE-599)BVBBV026951540 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | |a und | ||
| 049 | |a DE-188 | ||
| 100 | 1 | |a Srivastav, Anand |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Tight approximations for resource constrained scheduling and bin packing |c Anand Srivastav ; Peter Stangier |
| 264 | 1 | |a Berlin |b Freie Univ., Fachbereich Mathematik |c 1995 | |
| 300 | |a 36 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Freie Universität Berlin, Fachbereich Mathematik : Ser. B, Informatik |v 95,18 | |
| 700 | 1 | |a Stangier, Peter |e Sonstige |4 oth | |
| 830 | 0 | |a Freie Universität Berlin, Fachbereich Mathematik |v Ser. B, Informatik ; 95,18 |w (DE-604)BV026062980 |9 95,18 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-021612668 | ||
Datensatz im Suchindex
| _version_ | 1804144412928770048 |
|---|---|
| any_adam_object | |
| author | Srivastav, Anand |
| author_facet | Srivastav, Anand |
| author_role | aut |
| author_sort | Srivastav, Anand |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV026951540 |
| ctrlnum | (OCoLC)75724508 (DE-599)BVBBV026951540 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01065nam a2200301 cb4500</leader><controlfield tag="001">BV026951540</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110326s1995 d||| |||| 00||| und d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">96,B24,0301</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">94.749893.1</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75724508</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV026951540</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-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Srivastav, Anand</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tight approximations for resource constrained scheduling and bin packing</subfield><subfield code="c">Anand Srivastav ; Peter Stangier</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Freie Univ., Fachbereich Mathematik</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">36 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">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">Freie Universität Berlin, Fachbereich Mathematik : Ser. B, Informatik</subfield><subfield code="v">95,18</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stangier, Peter</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Freie Universität Berlin, Fachbereich Mathematik</subfield><subfield code="v">Ser. B, Informatik ; 95,18</subfield><subfield code="w">(DE-604)BV026062980</subfield><subfield code="9">95,18</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-021612668</subfield></datafield></record></collection> |
| id | DE-604.BV026951540 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T23:03:09Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-021612668 |
| oclc_num | 75724508 |
| open_access_boolean | |
| owner | DE-188 |
| owner_facet | DE-188 |
| physical | 36 S. graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Freie Univ., Fachbereich Mathematik |
| record_format | marc |
| series | Freie Universität Berlin, Fachbereich Mathematik |
| series2 | Freie Universität Berlin, Fachbereich Mathematik : Ser. B, Informatik |
| spelling | Srivastav, Anand Verfasser aut Tight approximations for resource constrained scheduling and bin packing Anand Srivastav ; Peter Stangier Berlin Freie Univ., Fachbereich Mathematik 1995 36 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Freie Universität Berlin, Fachbereich Mathematik : Ser. B, Informatik 95,18 Stangier, Peter Sonstige oth Freie Universität Berlin, Fachbereich Mathematik Ser. B, Informatik ; 95,18 (DE-604)BV026062980 95,18 |
| spellingShingle | Srivastav, Anand Tight approximations for resource constrained scheduling and bin packing Freie Universität Berlin, Fachbereich Mathematik |
| title | Tight approximations for resource constrained scheduling and bin packing |
| title_auth | Tight approximations for resource constrained scheduling and bin packing |
| title_exact_search | Tight approximations for resource constrained scheduling and bin packing |
| title_full | Tight approximations for resource constrained scheduling and bin packing Anand Srivastav ; Peter Stangier |
| title_fullStr | Tight approximations for resource constrained scheduling and bin packing Anand Srivastav ; Peter Stangier |
| title_full_unstemmed | Tight approximations for resource constrained scheduling and bin packing Anand Srivastav ; Peter Stangier |
| title_short | Tight approximations for resource constrained scheduling and bin packing |
| title_sort | tight approximations for resource constrained scheduling and bin packing |
| volume_link | (DE-604)BV026062980 |
| work_keys_str_mv | AT srivastavanand tightapproximationsforresourceconstrainedschedulingandbinpacking AT stangierpeter tightapproximationsforresourceconstrainedschedulingandbinpacking |