Viggo Kann

Available identifiers

zbMath Open kann.viggoMaRDI QIDQ293217

List of research outcomes

Publication	Date of Publication	Type
Structure in approximation classes	2023-12-12	Paper
On the approximability of the maximum common subgraph problem	2022-08-18	Paper
Polynomially bounded minimization problems which are hard to approximate	2019-03-29	Paper
Approximate Max \(k\)-Cut with subgraph guarantee	2016-06-09	Paper
Strong lower bounds on the approximability of some NPO PB-complete maximization problems	2010-06-17	Paper
Some APX-completeness results for cubic graphs	2000-06-04	Paper
https://portal.mardi4nfdi.de/entity/Q4942660	2000-03-16	Paper
Structure in Approximation Classes	1999-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4259987	1999-09-08	Paper
https://portal.mardi4nfdi.de/entity/Q4258216	1999-09-01	Paper
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems	1999-01-12	Paper
https://portal.mardi4nfdi.de/entity/Q4398359	1998-07-19	Paper
The complexity and approximability of finding maximum feasible subsystems of linear relations	1997-09-29	Paper
Approximability of maximum splitting of k-sets and some other Apx-complete problems	1997-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q4764626	1995-05-04	Paper
Maximum bounded \(H\)-matching is Max SNP-complete	1994-05-03	Paper
Maximum bounded 3-dimensional matching is MAX SNP-complete	1991-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Viggo Kann