Please use this identifier to cite or link to this item:
https://doi.org/10.15480/882.4875
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Abu-Khzam, Faisal N. | - |
| dc.contributor.author | Lamm, Sebastian | - |
| dc.contributor.author | Mnich, Matthias | - |
| dc.contributor.author | Noe, Alexander | - |
| dc.contributor.author | Schulz, Christian | - |
| dc.contributor.author | Strash, Darren | - |
| dc.date.accessioned | 2023-01-20T12:56:15Z | - |
| dc.date.available | 2023-01-20T12:56:15Z | - |
| dc.date.issued | 2023-01-18 | - |
| dc.identifier.citation | Algorithms for Big Data (2023) | de_DE |
| dc.identifier.uri | http://hdl.handle.net/11420/14591 | - |
| dc.description.abstract | Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has resulted in an algorithmic toolbox that is by now well-established. However, these theoretical algorithmic ideas have received very little attention from the practical perspective. We survey recent trends in data reduction engineering results for selected problems. Moreover, we describe concrete techniques that may be useful for future implementations in the area and give open problems and research questions. | en |
| dc.description.sponsorship | Deutsche Forschungsgemeinschaft (DFG) | de_DE |
| dc.language.iso | en | de_DE |
| dc.publisher | Springer Nature Switzerland | de_DE |
| dc.rights | CC BY 4.0 | de_DE |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | de_DE |
| dc.subject.ddc | 004: Informatik | de_DE |
| dc.subject.ddc | 510: Mathematik | de_DE |
| dc.title | Recent advances in practical data reduction | de_DE |
| dc.type | inBook | de_DE |
| dc.identifier.doi | 10.15480/882.4875 | - |
| dc.type.dini | bookPart | - |
| dcterms.DCMIType | Text | - |
| tuhh.identifier.urn | urn:nbn:de:gbv:830-882.0208766 | - |
| tuhh.oai.show | true | de_DE |
| tuhh.abstract.english | Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has resulted in an algorithmic toolbox that is by now well-established. However, these theoretical algorithmic ideas have received very little attention from the practical perspective. We survey recent trends in data reduction engineering results for selected problems. Moreover, we describe concrete techniques that may be useful for future implementations in the area and give open problems and research questions. | de_DE |
| tuhh.publisher.doi | 10.1007/978-3-031-21534-6_6 | - |
| tuhh.publication.institute | Algorithmen und Komplexität E-11 | de_DE |
| tuhh.identifier.doi | 10.15480/882.4875 | - |
| tuhh.type.opus | InBuch (Kapitel / Teil einer Monographie) | - |
| tuhh.gvk.hasppn | false | - |
| tuhh.hasurn | false | - |
| dc.type.driver | bookPart | - |
| dc.type.casrai | Book Chapter | - |
| tuhh.container.startpage | 97 | de_DE |
| tuhh.container.endpage | 133 | de_DE |
| dc.relation.project | Kernelisierung für große Datenmengen | de_DE |
| dc.rights.nationallicense | false | de_DE |
| tuhh.relation.ispartofseries | Lecture notes in computer science | de_DE |
| tuhh.relation.ispartofseriesnumber | 13201 | de_DE |
| datacite.relation.IsNewVersionOf | doi:10.15480/882.4144 | - |
| datacite.relation.IsPartOf | isbn:978-3-031-21534-6 | - |
| local.status.inpress | false | de_DE |
| local.type.version | publishedVersion | de_DE |
| local.publisher.peerreviewed | true | de_DE |
| datacite.resourceType | Article | - |
| datacite.resourceTypeGeneral | BookChapter | - |
| item.tuhhseriesid | Lecture notes in computer science | - |
| item.mappedtype | inBook | - |
| item.openairetype | inBook | - |
| item.seriesref | Lecture notes in computer science;13201 | - |
| item.languageiso639-1 | en | - |
| item.grantfulltext | open | - |
| item.cerifentitytype | Publications | - |
| item.creatorOrcid | Abu-Khzam, Faisal N. | - |
| item.creatorOrcid | Lamm, Sebastian | - |
| item.creatorOrcid | Mnich, Matthias | - |
| item.creatorOrcid | Noe, Alexander | - |
| item.creatorOrcid | Schulz, Christian | - |
| item.creatorOrcid | Strash, Darren | - |
| item.creatorGND | Abu-Khzam, Faisal N. | - |
| item.creatorGND | Lamm, Sebastian | - |
| item.creatorGND | Mnich, Matthias | - |
| item.creatorGND | Noe, Alexander | - |
| item.creatorGND | Schulz, Christian | - |
| item.creatorGND | Strash, Darren | - |
| item.fulltext | With Fulltext | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_3248 | - |
| crisitem.project.funder | Deutsche Forschungsgemeinschaft (DFG) | - |
| crisitem.project.funderid | 501100001659 | - |
| crisitem.project.funderrorid | 018mejw64 | - |
| crisitem.project.grantno | MN 59/1-1 | - |
| crisitem.author.dept | Algorithmen und Komplexität E-11 | - |
| crisitem.author.orcid | 0000-0002-4721-5354 | - |
| crisitem.author.orcid | 0000-0002-2823-3506 | - |
| crisitem.author.orcid | 0000-0001-7095-8749 | - |
| crisitem.author.parentorg | Studiendekanat Elektrotechnik, Informatik und Mathematik (E) | - |
| crisitem.funder.funderid | 501100001659 | - |
| crisitem.funder.funderrorid | 018mejw64 | - |
| Appears in Collections: | Publications with fulltext | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 978-3-031-21534-6_6.pdf | Full Text | 641,43 kB | Adobe PDF | View/Open |
Note about this record
Cite this record
Export
This item is licensed under a Creative Commons License
