1 citations · 1 across the 15 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes
Gopika Sharma, Arti Pandey, Michael C. Wigal
For a given graph , a maximum internal spanning tree of is a spanning tree of with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem…
cs.DS2021
Hardness and Approximation of Submodular Minimum Linear Ordering Problems
Majid Farhadi, Swati Gupta, Shengding Sun +2
The minimum linear ordering problem (MLOP) generalizes well-known combinatorial optimization problems such as minimum linear arrangement and minimum sum set cover. MLOP seeks to mi…