Stable matchings beyond stable marriage: models, algorithms, complexity:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
2023
|
| Schlagworte: | |
| Online-Zugang: | kostenfrei |
| Beschreibung: | XIII, 239 Seiten Diagramme |
| DOI: | 10.14279/depositonce-16756 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV048686575 | ||
| 003 | DE-604 | ||
| 005 | 20230316 | ||
| 007 | t | ||
| 008 | 230201s2023 |||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)1369561958 | ||
| 035 | |a (DE-599)BVBBV048686575 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Heeger, Klaus |e Verfasser |0 (DE-588)1171940645 |4 aut | |
| 245 | 1 | 0 | |a Stable matchings beyond stable marriage: models, algorithms, complexity |c vorgelegt von M. Sc. Klaus Heeger |
| 264 | 1 | |a Berlin |c 2023 | |
| 300 | |a XIII, 239 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |b Dissertation |c Technische Universität Berlin |d 2022 | ||
| 650 | 0 | 7 | |a Matching |g Graphentheorie |0 (DE-588)4831446-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Matching |g Graphentheorie |0 (DE-588)4831446-8 |D s |
| 689 | 0 | 1 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o 10.14279/depositonce-16756 |w (DE-604)BV048686586 |
| 856 | 4 | 1 | |u https://doi.org/10.14279/depositonce-16756 |x Resolving-System |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
Datensatz im Suchindex
| _version_ | 1805077813933375488 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Heeger, Klaus |
| author_GND | (DE-588)1171940645 |
| author_facet | Heeger, Klaus |
| author_role | aut |
| author_sort | Heeger, Klaus |
| author_variant | k h kh |
| building | Verbundindex |
| bvnumber | BV048686575 |
| classification_rvk | ST 134 |
| collection | ebook |
| ctrlnum | (OCoLC)1369561958 (DE-599)BVBBV048686575 |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.14279/depositonce-16756 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV048686575</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230316</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">230201s2023 |||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1369561958</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048686575</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heeger, Klaus</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1171940645</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Stable matchings beyond stable marriage: models, algorithms, complexity</subfield><subfield code="c">vorgelegt von M. Sc. Klaus Heeger</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 239 Seiten</subfield><subfield code="b">Diagramme</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="b">Dissertation</subfield><subfield code="c">Technische Universität Berlin</subfield><subfield code="d">2022</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matching</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4831446-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</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">Matching</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4831446-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="o">10.14279/depositonce-16756</subfield><subfield code="w">(DE-604)BV048686586</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.14279/depositonce-16756</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV048686575 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T21:26:37Z |
| indexdate | 2024-07-20T06:19:10Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034060855 |
| oclc_num | 1369561958 |
| open_access_boolean | 1 |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | XIII, 239 Seiten Diagramme |
| psigel | ebook |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| record_format | marc |
| spelling | Heeger, Klaus Verfasser (DE-588)1171940645 aut Stable matchings beyond stable marriage: models, algorithms, complexity vorgelegt von M. Sc. Klaus Heeger Berlin 2023 XIII, 239 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Dissertation Technische Universität Berlin 2022 Matching Graphentheorie (DE-588)4831446-8 gnd rswk-swf Parametrisierte Komplexität (DE-588)4818897-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Matching Graphentheorie (DE-588)4831446-8 s Parametrisierte Komplexität (DE-588)4818897-9 s DE-604 Erscheint auch als Online-Ausgabe 10.14279/depositonce-16756 (DE-604)BV048686586 https://doi.org/10.14279/depositonce-16756 Resolving-System kostenfrei Volltext |
| spellingShingle | Heeger, Klaus Stable matchings beyond stable marriage: models, algorithms, complexity Matching Graphentheorie (DE-588)4831446-8 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd |
| subject_GND | (DE-588)4831446-8 (DE-588)4818897-9 (DE-588)4113937-9 |
| title | Stable matchings beyond stable marriage: models, algorithms, complexity |
| title_auth | Stable matchings beyond stable marriage: models, algorithms, complexity |
| title_exact_search | Stable matchings beyond stable marriage: models, algorithms, complexity |
| title_exact_search_txtP | Stable matchings beyond stable marriage: models, algorithms, complexity |
| title_full | Stable matchings beyond stable marriage: models, algorithms, complexity vorgelegt von M. Sc. Klaus Heeger |
| title_fullStr | Stable matchings beyond stable marriage: models, algorithms, complexity vorgelegt von M. Sc. Klaus Heeger |
| title_full_unstemmed | Stable matchings beyond stable marriage: models, algorithms, complexity vorgelegt von M. Sc. Klaus Heeger |
| title_short | Stable matchings beyond stable marriage: models, algorithms, complexity |
| title_sort | stable matchings beyond stable marriage models algorithms complexity |
| topic | Matching Graphentheorie (DE-588)4831446-8 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd |
| topic_facet | Matching Graphentheorie Parametrisierte Komplexität Hochschulschrift |
| url | https://doi.org/10.14279/depositonce-16756 |
| work_keys_str_mv | AT heegerklaus stablematchingsbeyondstablemarriagemodelsalgorithmscomplexity |