Mathematical Foundations of Computer Science 2004

From MaRDI portal

Revision as of 22:12, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5311124

Jump to:navigation, search

DOI10.1007/b99679zbMath1096.68166OpenAlexW2488008928MaRDI QIDQ5311124

Xiuzhen Huang, Ge Xia, Iyad A. Kanj, Jian'er Chen

Publication date: 22 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99679

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Approximation algorithms (68W25)

Related Items (5)

Fixed-parameter approximation: conceptual framework and approximability results ⋮ Structure of polynomial-time approximation ⋮ On the computational hardness based on linear fpt-reductions ⋮ Parameterized algorithmics for linear arrangement problems ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness

This page was built for publication: Mathematical Foundations of Computer Science 2004

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5311124&oldid=19979127"