| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Round and Bipartize for Vertex Cover Approximation | Kashaev, Danish et al. | 2023 |
| 2 | Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node | Brokkelkamp, Ruben et al. | 2019 |
| 3 | Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond | Birmpas, Georgios et al. | 2019 |
| 4 | The Ground-Set-Cost Budgeted Maximum Coverage Problem | van Heuven van Staereling, Irving et al. | 2016 |
| 5 | Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players | Jelinek, Tomas et al. | 2014 |
| 6 | On the Smoothed Price of Anarchy of the Traffic Assignment Problem | Buriol, Luciana et al. | 2011 |
| 7 | Topology Matters: Smoothed Competitiveness of Metrical Task Systems | Schäfer, Guido et al. | 2005 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |