Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Neil
Last name:	Olver
DBLP:	22/2571
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 10  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Neil Olver, Rico Zenklusen. Chain-Constrained Spanning Trees.	Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings 2013	(0)	2013
	Conference paper Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen. Matroids and integrality gaps for hypergraphic steiner tree relaxations.	Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012 2012	(0)	2012
	Conference paper Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver. Inner product spaces for MinSum coordination mechanisms.	Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011 2011	(0)	2011
	Journal article Navin Goyal, Neil Olver, F. Bruce Shepherd. Dynamic vs. Oblivious Routing in Network Design.	Algorithmica 2011, Volume 61	(0)	2011
	Conference paper Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen. Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations	CoRR 2011, Volume 0	(0)	2011
	Conference paper Neil Olver, F. Bruce Shepherd. Approximability of Robust Network Design.	Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010	(0)	2010
	Conference paper Navin Goyal, Neil Olver, F. Bruce Shepherd. Dynamic vs. Oblivious Routing in Network Design.	Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings 2009	(0)	2009
	Journal article Babak Farzad, Neil Olver, Adrian Vetta. A Priority-Based Model of Routing.	Chicago J. Theor. Comput. Sci. 2008, Volume 2008	(0)	2008
	Conference paper Navin Goyal, Neil Olver, F. Bruce Shepherd. The vpn conjecture is true.	Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 2008	(0)	2008
	Conference paper Louigi Addario-Berry, Neil Olver, Adrian Vetta. A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games.	J. Graph Algorithms Appl. 2007, Volume 11	(0)	2007

Show item 1 to 10 of 10  

Your query returned 10 matches in the database.