Przejdź do menu głównegoPrzejdź do wyszukiwarkiPrzejdź do zawartości
Logo DigiLab - Scientific Research Aggregator Controller
  • Home page
  • Tight inapproximability of minimum maximal matching on bipartite graphs and related problems

Description

  • Title: Tight inapproximability of minimum maximal matching on bipartite graphs and related problems
  • Group publication title: LNCS : nr 12982
  • Collective work title: Approximation and Online Algorithms : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6?10, 2021, Revised Selected Papers
  • Creator: Dudycz, Szymon ; Manurangsi, Pasin ; Marcinkowski, Jan
  • Pages: S. 48-64
  • Publisher: Springer
  • Place of publishing: Cham
  • Date issued: 2021
  • Type: Tekst
  • Identifier: ISBN 9783030927011 ; https://doi.org/10.1007/978-3-030-92702-8_4
  • Language: eng
  • Has version: https://doi.org/10.1007/978-3-030-92702-8_4
  • Detailed object type: rozdz
  • Object type: Rozdział

The build of the Digital Demonstration Library was commissioned by the Name of the Institution of the Foundation's Institution. The Name of the Foundation under the Program, the Library Project and its creation under the patronage of the Name of the Institution.

Program Operacyjny Polska Cyfrowa
Rzeczpospolita Polska
Europejski Fundusz Rozwoju Regionalnego Unii Europejskiej
Biblioteka Uniwersytecka we Wrocławiu
Uniwersytet Wrocławski

The project titled "Workflow to develop digital publications at the university" co-financed by the European Union from the European Regional Development Fund.

We use files, through the cookie quality improvement layer of our website.For more information, please read the document Privacy Policy