Similar Items: Approximating the Network Design Problem for Potential-Based Flows
- Closed form logical error rate approximations for surface codes
- Flow Shop Scheduling with Stochastic Reentry
- On the redundancy of transitivity constraints in the clique partitioning problem
- Improving SAT Solvers on Orthogonal Latin Square Problems
- More on the ErdH os--Kleitman problem on matchings in set families
- Efficient Reconstruction of Arboreal Networks