Viggo Kann

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Structure in approximation classes
Lecture Notes in Computer Science
2023-12-12Paper
On the approximability of the maximum common subgraph problem
STACS 92
2022-08-18Paper
Polynomially bounded minimization problems which are hard to approximate
Automata, Languages and Programming
2019-03-29Paper
Approximate Max \(k\)-Cut with subgraph guarantee
Information Processing Letters
2016-06-09Paper
Strong lower bounds on the approximability of some NPO PB-complete maximization problems
Lecture Notes in Computer Science
2010-06-17Paper
Some APX-completeness results for cubic graphs
Theoretical Computer Science
2000-06-04Paper
scientific article; zbMATH DE number 1414323 (Why is no real title available?)
 
2000-03-16Paper
Structure in Approximation Classes
SIAM Journal on Computing
1999-10-28Paper
scientific article; zbMATH DE number 1332666 (Why is no real title available?)
 
1999-09-08Paper
scientific article; zbMATH DE number 1330033 (Why is no real title available?)
 
1999-09-01Paper
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Theoretical Computer Science
1999-01-12Paper
scientific article; zbMATH DE number 1175942 (Why is no real title available?)
 
1998-07-19Paper
The complexity and approximability of finding maximum feasible subsystems of linear relations
Theoretical Computer Science
1997-09-29Paper
Approximability of maximum splitting of k-sets and some other Apx-complete problems
Information Processing Letters
1997-02-27Paper
scientific article; zbMATH DE number 751135 (Why is no real title available?)
 
1995-05-04Paper
Maximum bounded \(H\)-matching is Max SNP-complete
Information Processing Letters
1994-05-03Paper
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
1991-01-01Paper


Research outcomes over time


This page was built for person: Viggo Kann