Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Sviridenko, Maxim I."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An approximation algorithm for hypergraph max
k
-cut with given sizes of parts
Alexander A. Ageev
,
Maxim I. Sviridenko
Lecture Notes in Computer Science
1879
, 2000, pp. 32-41
Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem
Klaus Jansen
,
Maxim I. Sviridenko
Lecture Notes in Computer Science
1770
, 2000, pp. 455-465
Approximation algorithms for maximum coverage and max cut with given sizes of parts
Alexander A. Ageev
,
Maxim I. Sviridenko
Lecture Notes in Computer Science
1610
, 1999, pp. 17-30
Best possible approximation algorithm for MAX SAT with cardinality constraint
Maxim I. Sviridenko
Lecture Notes in Computer Science
1444
, 1998, pp. 193-199