3 papers
cs.DS2026
Maximum Coverage -Antichains and Chains: A Greedy Approach
Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak +1
Given an acyclic digraph and a positive integer , the problem of Maximum Coverage -Antichains (resp. Chains) denoted as MA- (resp. MC-) asks to find set…
cs.DS2025
Width Parameters for Minimum Flow Decomposition
Andreas Grigorjew, Wanchote Jiamjitrak, Brendan Mumey +1
Minimum flow decomposition (MFD) is the strongly NP-hard problem of finding a smallest set of integer weighted - paths in an - DAG whose weighted sum is equal to a…
cs.DS2024
Simple approximation algorithms for Polyamorous Scheduling
Yuriy Biktairov, Leszek GÄ sieniec, Wanchote Po Jiamjitrak +3
In Polyamorous Scheduling, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted waiting time betwee…