( en | de | ru )

 

Disambiguation of "Lewandowski, Mateusz"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Node-Weighted k-MST on Planar Graphs.

, , and . Theory Comput. Syst., 64 (4): 626-644 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mateusz Laszczkowski

Mateusz Putyrski

Mateusz Majer

Mateusz Jochym

Mateusz Swist

 

Other publications of authors with the same name

Concave Connection Cost Facility Location and the Star Inventory Routing Problem., and . WAOA, volume 12806 of Lecture Notes in Computer Science, page 174-188. Springer, (2020)Tight Approximation Ratio for Minimum Maximal Matching., , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 181-193. Springer, (2019)Concave connection cost Facility Location and the Star Inventory Routing problem., and . CoRR, (2019)PTAS for Steiner Tree on Map Graphs., , , , and . CoRR, (2019)Dense Steiner problems: Approximation algorithms and inapproximability., , , and . CoRR, (2020)Sound Source Detection, Localization and Classification using Consecutive Ensemble of CRNN Models., and . DCASE, page 119-123. (2019)Tight Approximation Ratio for Minimum Maximal Matching., , and . CoRR, (2018)Approximating Node-Weighted k-MST on Planar Graphs., , and . Theory Comput. Syst., 64 (4): 626-644 (2020)Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs., , and . SWAT, volume 53 of LIPIcs, page 2:1-2:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Submodularity Gaps for Selected Network Design and Matching Problems., , , and . CoRR, (2023)