Neil Olver

From MaRDI portal
Person:344952

Available identifiers

zbMath Open olver.neilMaRDI QIDQ344952

List of research outcomes





PublicationDate of PublicationType
A duality based 2-approximation algorithm for maximum agreement forest2023-03-01Paper
Algorithms for Flows over Time with Scheduling Costs2022-10-14Paper
Improved Approximation Algorithms for Inventory Problems2022-10-14Paper
Algorithms for flows over time with scheduling costs2022-03-22Paper
Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks2022-02-18Paper
Performance of the Smallest-Variance-First Rule in Appointment Sequencing2022-02-16Paper
On the Integrality Gap of the Prize-Collecting Steiner Forest LP2021-07-28Paper
A short proof of convexity of step-out-step-in sequencing games2021-04-07Paper
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization2020-11-11Paper
Approximate multi-matroid intersection via iterative refinement2020-08-28Paper
Exploring the Tractability of the Capped Hose Model2020-05-27Paper
Fixed-order scheduling on parallel machines2020-02-06Paper
Approximate multi-matroid intersection via iterative refinement2020-02-06Paper
Pipage Rounding, Pessimistic Estimators and Matrix Concentration2019-06-20Paper
The Itinerant List Update problem2019-01-15Paper
A note on hierarchical hubbing for a generalization of the VPN problem2018-10-01Paper
https://portal.mardi4nfdi.de/entity/Q46079752018-03-15Paper
Chain-constrained spanning trees2018-02-28Paper
Long term behavior of dynamic equilibria in fluid queuing networks2017-08-31Paper
A simpler and faster strongly polynomial algorithm for generalized flow maximization2017-08-17Paper
https://portal.mardi4nfdi.de/entity/Q29696172017-03-22Paper
Explosion and linear transit times in infinite trees2017-02-17Paper
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree2016-11-25Paper
Adaptive Rumor Spreading2016-01-08Paper
Decentralized utilitarian mechanisms for scheduling games2015-08-12Paper
Approximability of Robust Network Design2014-07-11Paper
Inner product spaces for MinSum coordination mechanisms2014-06-05Paper
https://portal.mardi4nfdi.de/entity/Q54176932014-05-22Paper
Matroids and integrality gaps for hypergraphic steiner tree relaxations2014-05-13Paper
https://portal.mardi4nfdi.de/entity/Q54145632014-05-06Paper
The VPN Conjecture Is True2014-02-17Paper
On explosions in heavy-tailed branching random walks2013-10-17Paper
Chain-constrained spanning trees2013-03-19Paper
Dynamic vs. oblivious routing in network design2011-08-16Paper
Complex sine-Gordon-2: A new algorithm for multivortex solutions on the plane2010-01-17Paper
Dynamic vs. oblivious routing in network design2009-10-29Paper
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games2009-01-19Paper
https://portal.mardi4nfdi.de/entity/Q35497292009-01-05Paper

Research outcomes over time

This page was built for person: Neil Olver