Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems:
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | German |
| Published: |
1983
|
| Subjects: | |
| Physical Description: | 112 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV000119601 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 870612s1983 m||| 00||| ger d | ||
| 035 | |a (OCoLC)643892714 | ||
| 035 | |a (DE-599)BVBBV000119601 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-12 |a DE-19 |a DE-384 |a DE-703 |a DE-355 |a DE-N2 |a DE-83 |a DE-11 |a DE-188 | ||
| 084 | |a MAT 603f |2 stub | ||
| 100 | 1 | |a Schröter, Norbert |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems |
| 264 | 1 | |c 1983 | |
| 300 | |a 112 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Karlsruhe, Univ., Diss., 1983 | ||
| 650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rucksackproblem |0 (DE-588)4178600-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Rucksackproblem |0 (DE-588)4178600-2 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Rucksackproblem |0 (DE-588)4178600-2 |D s |
| 689 | 1 | 1 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
| 689 | 1 | |5 DE-604 | |
| 940 | 1 | |q TUB-nveb | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-000064260 | ||
Record in the Search Index
| _version_ | 1804114577682595840 |
|---|---|
| any_adam_object | |
| author | Schröter, Norbert |
| author_facet | Schröter, Norbert |
| author_role | aut |
| author_sort | Schröter, Norbert |
| author_variant | n s ns |
| building | Verbundindex |
| bvnumber | BV000119601 |
| classification_tum | MAT 603f |
| ctrlnum | (OCoLC)643892714 (DE-599)BVBBV000119601 |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01463nam a2200421 c 4500</leader><controlfield tag="001">BV000119601</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">870612s1983 m||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)643892714</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000119601</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">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-N2</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 603f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schröter, Norbert</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">112 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="502" ind1=" " ind2=" "><subfield code="a">Karlsruhe, Univ., Diss., 1983</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rucksackproblem</subfield><subfield code="0">(DE-588)4178600-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Rucksackproblem</subfield><subfield code="0">(DE-588)4178600-2</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">Approximation</subfield><subfield code="0">(DE-588)4002498-2</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">Rucksackproblem</subfield><subfield code="0">(DE-588)4178600-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-nveb</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000064260</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV000119601 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T15:08:56Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-000064260 |
| oclc_num | 643892714 |
| open_access_boolean | |
| owner | DE-12 DE-19 DE-BY-UBM DE-384 DE-703 DE-355 DE-BY-UBR DE-N2 DE-83 DE-11 DE-188 |
| owner_facet | DE-12 DE-19 DE-BY-UBM DE-384 DE-703 DE-355 DE-BY-UBR DE-N2 DE-83 DE-11 DE-188 |
| physical | 112 S. |
| psigel | TUB-nveb |
| publishDate | 1983 |
| publishDateSearch | 1983 |
| publishDateSort | 1983 |
| record_format | marc |
| spelling | Schröter, Norbert Verfasser aut Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems 1983 112 S. txt rdacontent n rdamedia nc rdacarrier Karlsruhe, Univ., Diss., 1983 Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf Rucksackproblem (DE-588)4178600-2 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Rucksackproblem (DE-588)4178600-2 s Algorithmus (DE-588)4001183-5 s Approximation (DE-588)4002498-2 s DE-604 Optimierungsproblem (DE-588)4390818-4 s |
| spellingShingle | Schröter, Norbert Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems Optimierungsproblem (DE-588)4390818-4 gnd Rucksackproblem (DE-588)4178600-2 gnd Approximation (DE-588)4002498-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4390818-4 (DE-588)4178600-2 (DE-588)4002498-2 (DE-588)4001183-5 (DE-588)4113937-9 |
| title | Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems |
| title_auth | Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems |
| title_exact_search | Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems |
| title_full | Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems |
| title_fullStr | Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems |
| title_full_unstemmed | Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems |
| title_short | Verteilungsabhängige Analyse approximativer Algorithmen am Beispiel des Knapsackproblems |
| title_sort | verteilungsabhangige analyse approximativer algorithmen am beispiel des knapsackproblems |
| topic | Optimierungsproblem (DE-588)4390818-4 gnd Rucksackproblem (DE-588)4178600-2 gnd Approximation (DE-588)4002498-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Optimierungsproblem Rucksackproblem Approximation Algorithmus Hochschulschrift |
| work_keys_str_mv | AT schroternorbert verteilungsabhangigeanalyseapproximativeralgorithmenambeispieldesknapsackproblems |