1 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
James M. Shook, Isabel Beichl
For a digraph , a set is said to be a feedback vertex set (FVS) if is acyclic. The problem of finding a smallest FVS is NP-hard. We present a matrix scal…
cs.DS2019★ 1 cited
A Sequential Importance Sampling Algorithm for Estimating Linear Extensions
Isabel Beichl, Alathea Jensen
In recent decades, a number of profound theorems concerning approximation of hard counting problems have appeared. These include estimation of the permanent, estimating the volume…