Orienteering for electioneering
From MaRDI portal
Publication:2417102
DOI10.1016/j.orl.2017.10.013MaRDI QIDQ2417102
Jonah Kallenbach, Robert D. Kleinberg, Scott Duke Kominers
Publication date: 11 June 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2017.10.013
90-XX: Operations research, mathematical programming
Related Items
Cites Work
- Unnamed Item
- Certification of an optimal TSP tour through 85,900 cities
- Multi-battle contests
- Improved algorithms for orienteering and related problems
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- All-Pay Contests
- Election Goals and the Allocation of Campaign Resources
- ETH Hardness for Densest-k-Subgraph with Perfect Completeness
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Approximation Algorithms for Orienteering and Discounted-Reward TSP