Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 2
Number of items: 2
  • Open Access
    Kashaev, D. (2026). Approximation via duality in offline, online and strategic settings. [Thesis, externally prepared, Universiteit van Amsterdam].
  • Open Access
    Kashaev, D., & Schäfer, G. (2023). Round and Bipartize for Vertex Cover Approximation. In N. Megow, & A. Smith (Eds.), International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) Article 20 (Leibniz International Proceedings in Informatics; Vol. 275). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.20, https://doi.org/10.48550/arXiv.2211.01699
Page of