Homology localization through the looking-glass of parameterized complexity theory
Homology localization means finding a cycle of lowest weight that represents a homology class in a simplicial complex. It is an NP-complete problem, which this paper addresses using parameterized complexity theory. We prove that to find even a constant factor approximation to this problem is W[1]-ha...
Saved in:
| Published in: | Journal of applied and computational topology Vol. 9; no. 2 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.06.2025
|
| ISSN: | 2367-1726, 2367-1734 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!