STACS 2005

From MaRDI portal

Revision as of 04:44, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

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

Publication:5710715

Jump to:navigation, search

DOI10.1007/B106485zbMath1118.68763OpenAlexW4230940848MaRDI QIDQ5710715

Mohammad Mahdian, Nicole Immorlica, Vahab S. Mirrokni

Publication date: 2 December 2005

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

An overview of graph covering and partitioning ⋮ Lane covering with partner bounds in collaborative truckload transportation procurement ⋮ Approximating the directed path partition problem ⋮ Parametric packing of selfish items and the subset sum algorithm

This page was built for publication: STACS 2005

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