|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 9 publication records. Showing 9 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen |
Matroids and integrality gaps for hypergraphic steiner tree relaxations.  |
STOC  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
Dynamic vs. Oblivious Routing in Network Design. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen |
Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver |
Inner product spaces for MinSum coordination mechanisms. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Olver, F. Bruce Shepherd |
Approximability of Robust Network Design. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
Dynamic vs. Oblivious Routing in Network Design. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Babak Farzad, Neil Olver, Adrian Vetta |
A Priority-Based Model of Routing. |
Chicago J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
The vpn conjecture is true. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
network design, robust optimization, oblivious routing |
| 1 | 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 |
DBLP BibTeX RDF |
|
Displaying result #1 - #9 of 9 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")