4 citations · 5 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2019
Heuristic Algorithm for Generalized Function Matching
Radu Stefan Mincu
The problem of generalized function matching can be defined as follows: given a pattern and a text , find a mapping a…
cs.DS2019
Heuristic algorithms for the Longest Filled Common Subsequence Problem
Radu Stefan Mincu, Alexandru Popa
At CPM 2017, Castelli et al. define and study a new variant of the Longest Common Subsequence Problem, termed the Longest Filled Common Subsequence Problem (LFCS). For the LFCS pro…
cs.DS2018★ 4 cited
Heuristic algorithms for the min-max edge 2-coloring problem
Radu Stefan Mincu, Alexandru Popa
In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study sev…