Complexity and inapproximability results for the Power Edge Set problem
- Sonia Toubaline
- Claudia D’Ambrosio
- et al.
- 2017
- J Combin Optim
Paper
Publications
11 results at J Combin Optim
Mathematical programming: Turing completeness and applications to software analysis
- Leo Liberti
- Fabrizio Marinelli
- 2014
- J Combin Optim
PaperFinding longest increasing and common subsequences in streaming data
- David Liben-Nowell
- Erik Vee
- et al.
- 2006
- J Combin Optim
PaperSeparating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
- Jon Lee
- Janny Leung
- et al.
- 2005
- J Combin Optim
PaperPipage rounding: A new method of constructing algorithms with proven performance guarantee
- A.A. Ageev
- M. Sviridenko
- 2004
- J Combin Optim
PaperSolving Steiner Tree Problems in Graphs with Lagrangian Relaxation
- Laura Bahiense
- Francisco Barahona
- et al.
- 2003
- J Combin Optim
PaperCropped cubes
- Jon Lee
- 2003
- J Combin Optim
PaperAll-different polytopes
- Jon Lee
- 2002
- J Combin Optim
PaperEfficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *
- Y.Y. Li
- K.S. Leung
- et al.
- 2000
- J Combin Optim
PaperApproximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
- M. Dawande
- J.R. Kalagnanam
- et al.
- 2000
- J Combin Optim
Paper