{"id":"https://openalex.org/W3044744384","doi":"https://doi.org/10.18452/21377","title":"Preprocessing to Deal with Hard Problems","display_name":"Preprocessing to Deal with Hard Problems","publication_year":2020,"publication_date":"2020-05-22","ids":{"openalex":"https://openalex.org/W3044744384","doi":"https://doi.org/10.18452/21377","mag":"3044744384"},"language":"de","primary_location":{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-032143006","is_oa":false,"landing_page_url":"http://edoc.hu-berlin.de/18452/22131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Hochschulschrift"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.18452/21377","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019166262","display_name":"Eva-Maria C. Hols","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hols, Eva-Maria Christiana","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5019166262"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5515000224113464,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5515000224113464,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.16110000014305115,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.09719999879598618,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5449437499046326},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.498002290725708},{"id":"https://openalex.org/keywords/data-science","display_name":"Data science","score":0.4743322730064392},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.3585469424724579},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.32075750827789307},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3160012364387512}],"concepts":[{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5449437499046326},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.498002290725708},{"id":"https://openalex.org/C2522767166","wikidata":"https://www.wikidata.org/wiki/Q2374463","display_name":"Data science","level":1,"score":0.4743322730064392},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3585469424724579},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32075750827789307},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3160012364387512}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-032143006","is_oa":false,"landing_page_url":"http://edoc.hu-berlin.de/18452/22131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Hochschulschrift"},{"id":"doi:10.18452/21377","is_oa":true,"landing_page_url":"https://doi.org/10.18452/21377","pdf_url":null,"source":{"id":"https://openalex.org/S4306400923","display_name":"edoc Publication server (Humboldt University of Berlin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39343248","host_organization_name":"Humboldt-Universit\u00e4t zu Berlin","host_organization_lineage":["https://openalex.org/I39343248"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:3044744384","is_oa":false,"landing_page_url":"https://edoc.hu-berlin.de/handle/18452/22131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.18452/21377","is_oa":true,"landing_page_url":"https://doi.org/10.18452/21377","pdf_url":null,"source":{"id":"https://openalex.org/S4306400923","display_name":"edoc Publication server (Humboldt University of Berlin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39343248","host_organization_name":"Humboldt-Universit\u00e4t zu Berlin","host_organization_lineage":["https://openalex.org/I39343248"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1976468483","https://openalex.org/W200564616","https://openalex.org/W2490706771","https://openalex.org/W43934320","https://openalex.org/W2471441392","https://openalex.org/W2157324291","https://openalex.org/W2140486831","https://openalex.org/W1863921198","https://openalex.org/W1558062873","https://openalex.org/W1834737061","https://openalex.org/W2105038944","https://openalex.org/W3186305678","https://openalex.org/W2029178560","https://openalex.org/W2164816816","https://openalex.org/W3119804058","https://openalex.org/W1772241399","https://openalex.org/W2171116055","https://openalex.org/W1982384331","https://openalex.org/W1918504188","https://openalex.org/W2891118272"],"abstract_inverted_index":{"In":[0,138],"der":[1,7,16,76,139,174,216,245],"klassischen":[2,77],"Komplexit\u00e4tstheorie":[3,141],"unterscheiden":[4],"wir":[5,39,72,102,118,167,187,206,228],"zwischen":[6,48],"Klasse":[8,17],"P":[9],"von":[10,19,190,221],"in":[11,30,119,215],"Polynomialzeit":[12,31,120],"l\u00f6sbaren":[13],"Problemen,":[14],"und":[15,52,112,127,158,235],"NP-schwer":[18],"Problemen":[20],"bei":[21],"denen":[22],"die":[23,38,74,103,176,188,199,207,247],"allgemeine":[24],"Annahme":[25],"ist,":[26],"dass":[27,60,198,237],"diese":[28,143],"nicht":[29],"l\u00f6sbar":[32],"sind.":[33],"Allerdings":[34],"sind":[35],"viele":[36],"Probleme,":[37],"l\u00f6sen":[40],"m\u00f6chten,":[41],"NP-schwer.":[42],"Gleichzeitig":[43],"besteht":[44],"eine":[45,109,121,131,218,239],"gro\u00dfe":[46],"Diskrepanz":[47],"den":[49,53],"empirisch":[50],"beobachteten":[51],"festgestellten":[54],"worst-case":[55],"Laufzeiten.":[56],"Es":[57,194],"ist":[58,91],"bekannt,":[59],"Vorverarbeitung":[61],"oder":[62],"Datenreduktion":[63],"auf":[64,84],"realen":[65],"Instanzen":[66,94],"zu":[67,99,180],"Laufzeitverbesserungen":[68],"f\u00fchrt.":[69],"Hier":[70],"sto\u00dfen":[71],"an":[73],"Grenze":[75],"Komplexit\u00e4tstheorie.":[78],"Der":[79],"Fokus":[80],"dieser":[81],"Arbeit":[82],"liegt":[83],"Vorverarbeitungsalgorithmen":[85],"f\u00fcr":[86,108,170],"NP-schwere":[87,149],"Probleme.":[88],"Unser":[89],"Ziel":[90],"es,":[92],"bestimmte":[93],"eines":[95],"NP-schweren":[96],"Problems":[97],"vorverarbeiten":[98],"k\u00f6nnen,":[100],"indem":[101],"Struktur":[104],"betrachten.":[105],"Genauer":[106],"gesagt,":[107],"gegebene":[110],"Instanz":[111,123],"einen":[113],"zus\u00e4tzlichen":[114],"Parameter":[115,175,246],"l,":[116],"m\u00f6chten":[117],"\u00e4quivalente":[122],"berechnen,":[124],"deren":[125],"Gr\u00f6\u00dfe":[126,177],"Parameterwert":[128,134],"nur":[129],"durch":[130],"Funktion":[132],"im":[133],"l":[135],"beschr\u00e4nkt":[136],"ist.":[137,184,203,225,249],"parametrisierten":[140],"hei\u00dfen":[142],"Algorithmen":[144],"Kernelisierung.":[145],"Wir":[146],"werden":[147,166],"drei":[148],"Graphenprobleme":[150],"betrachten,":[151],"n\u00e4mlich":[152],"Vertex":[153,161,164,232],"Cover,":[154],"Edge":[155,191],"Dominating":[156,192],"Set":[157,233],"Subset":[159,230],"Feedback":[160,231],"Set.":[162,193],"F\u00fcr":[163],"Cover":[165],"bekannte":[168],"Ergebnisse":[169],"Kernelisierungen":[171],"vereinheitlichen,":[172],"wenn":[173,212,244],"einer":[178,181,209],"Entfernungsmenge":[179],"gegebenen":[182],"Graphklasse":[183,217],"Anschlie\u00dfend":[185],"untersuchen":[186],"Kernelisierbarkeit":[189,200],"stellt":[195],"sich":[196],"heraus,":[197],"deutlich":[201],"komplexer":[202],"Dennoch":[204],"klassifizieren":[205],"Existenz":[208],"polynomiellen":[210],"Kernelisierung,":[211],"jeder":[213],"Graph":[214],"disjunkte":[219],"Vereinigung":[220],"konstant":[222],"gro\u00dfen":[223],"Komponenten":[224],"Schlie\u00dflich":[226],"betrachten":[227],"das":[229],"Problem":[234],"zeigen,":[236],"es":[238],"randomisierte":[240],"polynomielle":[241],"Kernelisierung":[242],"hat,":[243],"L\u00f6sungsgr\u00f6\u00dfe":[248]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}