Authors: AMALDI E KANN V

Citation: E. Amaldi et V. Kann, ON THE APPROXIMABILITY OF MINIMIZING NONZERO VARIABLES OR UNSATISFIEDRELATIONS IN LINEAR-SYSTEMS, Theoretical computer science, 209(1-2), 1998, pp. 237-260

Authors: KANN V LAGERGREN J PANCONESI A

Citation: V. Kann et al., APPROXIMATE MAX K-CUT WITH SUBGRAPH GUARANTEE, Information processing letters, 65(3), 1998, pp. 145-150

Authors: KANN V KHANNA S LAGERGREN J PANCONESI A

Citation: V. Kann et al., ON THE HARDNESS OF APPROXIMATING MAX K-CUT AND ITS DUAL, Chicago journal of theoretical computer science, (2), 1997, pp. 1-18

Authors: KANN V LAGERGREN J PANCONESI A

Citation: V. Kann et al., APPROXIMABILITY OF MAXIMUM SPLITTING OF K-SETS AND SOME OTHER APX-COMPLETE PROBLEMS, Information processing letters, 58(3), 1996, pp. 105-110

Authors: AMALDI E KANN V

Citation: E. Amaldi et V. Kann, THE COMPLEXITY AND APPROXIMABILITY OF FINDING MAXIMUM FEASIBLE SUBSYSTEMS OF LINEAR RELATIONS, Theoretical computer science, 147(1-2), 1995, pp. 181-210

Authors: KANN V

Citation: V. Kann, MAXIMUM BOUNDED H-MATCHING IS MAX SNP-COMPLETE, Information processing letters, 49(6), 1994, pp. 309-318