Patricia Carstensen. Complexity of some parametric integer and network programming problems. In Mathematical Programming, volume 26, pages 64--75, 1983. 85 86 Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Lower Bounds For Parallel Algorithms - Shah (2001) (Correct)
A Lower Bound for the Shortest Path Problem - Mulmuley (Correct)
Lower Bounds In A Parallel Model Without Bit Operations - Mulmuley (1999) (2 citations) (Correct)
Parametric Problems on Graphs of Bounded Tree-width - Fernández-Baca, Slutzki (1992) (1 citation) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC