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
[1]
Hilfe
Suche: Author="Iyengar, G."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating fractional packings and coverings in
O(1/\epsilon)
iterations
D. Bienstock
,
G. Iyengar
SIAM Journal on Computing
35
(4), 2006, pp. 825-854
Approximation algorithms for semidefinite packing problems with applications to MAXCUT and graph coloring
G. Iyengar
,
D.J. Phillips
,
C. Stein
Lecture Notes in Computer Science
3509
, 2005, pp. 152-166
Solving fractional packing problems in
O^\ast(\frac{1}{\epsilon})
iterations
D. Bienstock
,
G. Iyengar
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 146-155
Cutting planes for mixed 0-1 semidefinite programs
G. Iyengar
,
M.T. Çezik
Lecture Notes in Computer Science
2081
, 2001, pp. 251-263