papers
Publications (9)
cs.DS2015
Approximate Deadline-Scheduling with Precedence Constraints
Hossein Efsandiari, MohammadTaghi Hajiaghyi, Jochen Koenemann +3
cs.DM2010
Hypergraphic LP Relaxations for Steiner Trees
Deeparnab Chakrabarty, Jochen Koenemann, David Pritchard
cs.DS2010
On Column-restricted and Priority Covering Integer Programs
Deeparnab Chakrabarty, Elyot Grant, Jochen Koenemann
cs.DS2016
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs
Zachary Friggstad, Jochen Koenemann, Mohammad Shadravan
cs.GT2019
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Jochen Koenemann, Kanstantsin Pashkovich, Justin Toth
cs.GT2013
Network bargaining with general capacities
Linda Farczadi, Konstantinos Georgiou, Jochen Koenemann
cs.DM2010
Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound
Deeparnab Chakrabarty, Jochen Koenemann, David Pritchard
cs.GT2012
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances
Jochen Koenemann, Kate Larson, David Steiner
cs.DM2012
Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances
Isaac Fung, Konstantinos Georgiou, Jochen Koenemann +1