1 citations · 1 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
PTAS for Steiner Tree on Map Graphs
Jarosław Byrka, Mateusz Lewandowski, Syed Mohammad Meesum +2
We study the Steiner tree problem on map graphs, which substantially generalize planar graphs as they allow arbitrarily large cliques. We obtain a PTAS for Steiner tree on map grap…
math.CO2019
Hypergraphic Degree Sequences are Hard
Antoine Deza, Asaf Levin, Syed M. Meesum +1
We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.