FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

From MaRDI portal

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

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

Publication:5191526

Jump to:navigation, search

DOI10.1007/b94618zbMath1205.68515OpenAlexW2246750081MaRDI QIDQ5191526

R. Ravi, Jochen Könemann

Publication date: 6 August 2009

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

On approximating degree-bounded network design problems ⋮ Approximation algorithms for finding low-degree subgraphs ⋮ On approximating degree-bounded network design problems

This page was built for publication: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

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