Viggo Kann
Viggo Kann
Professor i datalogi, KTH
Verified email at nada.kth.se
TitleCited byYear
Complexity and approximation: Combinatorial optimization problems and their approximability properties
G Ausiello, P Crescenzi, G Gambosi, V Kann, A Marchetti-Spaccamela, ...
Springer Science & Business Media, 2012
21592012
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
E Amaldi, V Kann
Theoretical Computer Science 209 (1-2), 237-260, 1998
7251998
A compendium of NP optimization problems
P Crescenzi, V Kann, M Halldórsson, M Karpinski
4881995
On the approximability of NP-complete optimization problems
V Kann
Royal Institute of Technology, 1992
3181992
Maximum bounded 3-dimensional matching is MAX SNP-complete
V Kann
Information Processing Letters 37 (1), 27-35, 1991
2821991
Some APX-completeness results for cubic graphs
P Alimonti, V Kann
Theoretical Computer Science 237 (1-2), 123-134, 2000
2772000
The complexity and approximability of finding maximum feasible subsystems of linear relations
E Amaldi, V Kann
Theoretical computer science 147 (1-2), 181-210, 1995
2401995
Hardness of approximating problems on cubic graphs
P Alimonti, V Kann
Italian Conference on Algorithms and Complexity, 288-298, 1997
1641997
Implementing an efficient part‐of‐speech tagger
J Carlberger, V Kann
Software: Practice and Experience 29 (9), 815-832, 1999
1281999
On the Hardness of Approximating Max k-Cut and Its Dual.
V Kann, S Khanna, J Lagergren, A Panconesi
ISTCS, 61-67, 1996
981996
Structure in approximation classes
P Crescenzi, V Kann, R Silvestri, L Trevisan
SIAM Journal on Computing 28 (5), 1759-1782, 1999
871999
On the approximability of the maximum common subgraph problem
V Kann
Annual Symposium on Theoretical Aspects of Computer Science, 375-388, 1992
771992
Structure in approximation classes
P Crescenzi, V Kann, R Silvestri, L Trevisan
International Computing and Combinatorics Conference, 539-548, 1995
711995
Polynomially bounded minimization problems that are hard to approximate
V Kann
Nord. J. Comput. 1 (3), 317-331, 1994
701994
Granska–an efficient hybrid system for Swedish grammar checking
R Domeij, O Knutsson, J Carlberger, V Kann
Proceedings of the 12th Nordic Conference of Computational Linguistics …, 2000
672000
A compendium of NP optimization problems
P Crescenzi, V Kann, M Halldórsson, M Karpinski, G Woeginger
URL: http://www. nada. kth. se/~ viggo/problemlist/compendium. html, 1997
661997
Free construction of a free Swedish dictionary of synonyms
V Kann, M Rosell
Proceedings of the 15th Nordic Conference of Computational Linguistics …, 2006
512006
Comparing comparisons: Document clustering evaluation using two manual classifications
M Rosell, V Kann, JE Litton
ICON 2004, India., 2004
512004
Maximum bounded H-matching is MAX SNP-complete
V Kann
Information Processing Letters 49 (6), 309-318, 1994
491994
Detection of spelling errors in Swedish not using a word list en clair
R Domeij, J Hollman, V Kann
Journal of Quantitative Linguistics 1 (3), 195-201, 1994
441994
The system can't perform the operation now. Try again later.
Articles 1–20