Andreas Grigorjew

activity

20232026

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025

Forcing a unique minimum spanning tree and a unique shortest path

Tatsuya Gima, Andreas Grigorjew, Yasuaki Kobayashi +7

A forcing set $S$ in a combinatorial problem is a set of elements such that there is a unique solution that contains all the elements in $S$ . An anti-forcing set is the symmetric c…

cs.DS2025

Maximum Coverage $k$ -Antichains and Chains: A Greedy Approach

Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak +1

Given an acyclic digraph $G = (V, E)$ and a positive integer $k$ , the problem of Maximum Coverage $k$ -Antichains (resp. Chains) denoted as MA- $k$ (resp. MC- $k$ ) asks to find $k$ set…

cs.DS2024

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 $s$ - $t$ paths in an $s$ - $t$ DAG $G$ whose weighted sum is equal to a…

Forcing a unique minimum spanning tree and a unique shortest path

Maximum Coverage k-Antichains and Chains: A Greedy Approach

Width Parameters for Minimum Flow Decomposition

Maximum Coverage $k$ -Antichains and Chains: A Greedy Approach