Approximation algorithms for some p-complete scheduling problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
1975
|
| Schlagworte: | |
| Beschreibung: | Minneapolis, Minn., Univ., Diss., 1975. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich. |
| Beschreibung: | V, 105 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021983078 | ||
| 003 | DE-604 | ||
| 005 | 20041217000000.0 | ||
| 007 | t | ||
| 008 | 041214s1975 m||| 00||| eng d | ||
| 035 | |a (OCoLC)17908094 | ||
| 035 | |a (DE-599)BVBBV021983078 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 100 | 1 | |a Kim, Chul Eun |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Approximation algorithms for some p-complete scheduling problems |c by Chul Eun Kim |
| 264 | 1 | |c 1975 | |
| 300 | |a V, 105 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Minneapolis, Minn., Univ., Diss., 1975. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich. | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015198135 | ||
Datensatz im Suchindex
| _version_ | 1804135956875313152 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Kim, Chul Eun |
| author_facet | Kim, Chul Eun |
| author_role | aut |
| author_sort | Kim, Chul Eun |
| author_variant | c e k ce cek |
| building | Verbundindex |
| bvnumber | BV021983078 |
| ctrlnum | (OCoLC)17908094 (DE-599)BVBBV021983078 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00836nam a2200265zc 4500</leader><controlfield tag="001">BV021983078</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20041217000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">041214s1975 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)17908094</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021983078</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kim, Chul Eun</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation algorithms for some p-complete scheduling problems</subfield><subfield code="c">by Chul Eun Kim</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1975</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">V, 105 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="500" ind1=" " ind2=" "><subfield code="a">Minneapolis, Minn., Univ., Diss., 1975. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich.</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015198135</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021983078 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:10:05Z |
| indexdate | 2024-07-09T20:48:45Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015198135 |
| oclc_num | 17908094 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | V, 105 S. |
| publishDate | 1975 |
| publishDateSearch | 1975 |
| publishDateSort | 1975 |
| record_format | marc |
| spelling | Kim, Chul Eun Verfasser aut Approximation algorithms for some p-complete scheduling problems by Chul Eun Kim 1975 V, 105 S. txt rdacontent n rdamedia nc rdacarrier Minneapolis, Minn., Univ., Diss., 1975. -Kopie, erschienen im Verl. Univ. Microfilms Internat., Ann Arbor, Mich. (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Kim, Chul Eun Approximation algorithms for some p-complete scheduling problems |
| subject_GND | (DE-588)4113937-9 |
| title | Approximation algorithms for some p-complete scheduling problems |
| title_auth | Approximation algorithms for some p-complete scheduling problems |
| title_exact_search | Approximation algorithms for some p-complete scheduling problems |
| title_exact_search_txtP | Approximation algorithms for some p-complete scheduling problems |
| title_full | Approximation algorithms for some p-complete scheduling problems by Chul Eun Kim |
| title_fullStr | Approximation algorithms for some p-complete scheduling problems by Chul Eun Kim |
| title_full_unstemmed | Approximation algorithms for some p-complete scheduling problems by Chul Eun Kim |
| title_short | Approximation algorithms for some p-complete scheduling problems |
| title_sort | approximation algorithms for some p complete scheduling problems |
| topic_facet | Hochschulschrift |
| work_keys_str_mv | AT kimchuleun approximationalgorithmsforsomepcompleteschedulingproblems |