Mark Velednitsky

From MaRDI portal
(Redirected from Mark Velednitsky)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
Journal of Combinatorial Optimization
2022-10-04Paper
Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts
Journal of Combinatorial Optimization
2022-04-13Paper
An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
Theory of Computing Systems
2020-06-02Paper
Solving \((k-1)\)-stable instances of \(k\)-Terminal Cut with isolating cuts
(available as arXiv preprint)
2020-05-13Paper
The dimension of valid distance drawings of signed graphs
Discrete & Computational Geometry
2019-12-30Paper
Isolation branching: a branch and bound algorithm for the k-terminal cut problem2019-10-11Paper
Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem
Operations Research Letters
2019-02-22Paper
DISPATCH: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
(available as arXiv preprint)
2019-01-15Paper
Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
Operations Research
2017-09-26Paper


Research outcomes over time


This page was built for person: Mark Velednitsky