The following pages link to Neil Olver (Q344952):
Displaying 38 items.
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- On explosions in heavy-tailed branching random walks (Q373551) (← links)
- Explosion and linear transit times in infinite trees (Q510268) (← links)
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- (Q843868) (redirect page) (← links)
- Complex sine-Gordon-2: A new algorithm for multivortex solutions on the plane (Q843869) (← links)
- Chain-constrained spanning trees (Q1702777) (← links)
- The Itinerant List Update problem (Q1757780) (← links)
- A note on hierarchical hubbing for a generalization of the VPN problem (Q1785741) (← links)
- Algorithms for flows over time with scheduling costs (Q2118123) (← links)
- Fixed-order scheduling on parallel machines (Q2293084) (← links)
- Long term behavior of dynamic equilibria in fluid queuing networks (Q2401154) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- A short proof of convexity of step-out-step-in sequencing games (Q2661633) (← links)
- A duality based 2-approximation algorithm for maximum agreement forest (Q2687064) (← links)
- (Q2969617) (← links)
- Adaptive Rumor Spreading (Q3460795) (← links)
- (Q3549729) (← links)
- (Q4607975) (← links)
- Chain-Constrained Spanning Trees (Q4910827) (← links)
- A simpler and faster strongly polynomial algorithm for generalized flow maximization (Q4977964) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks (Q5031025) (← links)
- Performance of the Smallest-Variance-First Rule in Appointment Sequencing (Q5031672) (← links)
- Improved Approximation Algorithms for Inventory Problems (Q5041737) (← links)
- Algorithms for Flows over Time with Scheduling Costs (Q5041740) (← links)
- Exploring the Tractability of the Capped Hose Model (Q5111705) (← links)
- A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization (Q5133966) (← links)
- Approximability of Robust Network Design (Q5169714) (← links)
- A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games (Q5301416) (← links)
- Pipage Rounding, Pessimistic Estimators and Matrix Concentration (Q5384030) (← links)
- The VPN Conjecture Is True (Q5395715) (← links)
- (Q5414563) (← links)
- Matroids and integrality gaps for hypergraphic steiner tree relaxations (Q5415542) (← links)
- (Q5417693) (← links)
- Inner product spaces for MinSum coordination mechanisms (Q5419124) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5919389) (← links)
