| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Improved Approximation Algorithms for the Expanding Search Problem | Griesbach, Svenja M. et al. | 2023 |
| 2 | Incremental Maximization via Continuization | Disser, Yann et al. | 2023 |
| 3 | Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint | Klimm, Max et al. | 2022 |
| 4 | Demand-Independent Optimal Tolls | Colini-Baldeschi, Riccardo et al. | 2018 |
| 5 | Distance-Preserving Graph Contractions | Bernstein, Aaron et al. | 2018 |
| 6 | Approximate Pure Nash Equilibria in Weighted Congestion Games | Hansknecht, Christoph et al. | 2014 |
| 7 | Complexity and Approximation of the Continuous Network Design Problem | Gairing, Martin et al. | 2014 |
| 8 | Packing a Knapsack of Unknown Capacity | Disser, Yann et al. | 2014 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |