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="Karloff, Howard"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast algorithms for constructing maximum entropy summary trees
Richard Cole
,
Howard Karloff
Lecture Notes in Computer Science
8572
, 2014, pp. 332-343
Improved approximation algorithms for prize-collecting Steiner tree and TSP
Aaron Archer
,
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
SIAM Journal on Computing
40
(2), 2011, pp. 309-332
Scheduling to minimize staleness and stretch in real-time data warehouses
MohammadHossein Bateni
,
Lukasz Golab
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Theory of Computing Systems
49
(4), 2011, pp. 757-780
Improved approximation algorithms for label cover problems
Moses Charikar
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Algorithmica
61
(1), 2011, pp. 190-206
On parsimonious explanations for 2-D tree- and linearly-ordered data
Howard Karloff
,
Flip Korn
,
Konstantin Makarychev
,
Yuval Rabani
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 332-343
\l_2^2
spreading metrics for vertex ordering problems
Moses Charikar
,
Mohammad Taghi Hajiaghayi
,
Howard Karloff
,
Satish Rao
Algorithmica
56
(4), 2010, pp. 577-604
Scheduling to minimize staleness and stretch in real-time data warehouses
Mohammad Hossein Bateni
,
Lukasz Golab
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2009 (Calgary, Alberta, Canada, August 11-13, 2009)
, 2009, pp. 29-38
Improved approximation algorithms for label cover problems
Moses Charikar
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Lecture Notes in Computer Science
5757
, 2009, pp. 23-34
On earthmover distance, metric labeling, and 0-extension
Howard Karloff
,
Subhash Khot
,
Aranyak Mehta
,
Yuval Rabani
SIAM Journal on Computing
39
(2), 2009, pp. 371-387
Online multicast with egalitarian cost sharing
Moses Charikar
,
Howard Karloff
,
Claire Mathieu
,
Joseph (Seffi) Naor
,
Michael Saks
Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2008 (Munich, Germany, June 14-16, 2008)
, 2008, pp. 70-76
On earthmover distance, metric labeling, and 0-extension
Howard Karloff
,
Subhash Khot
,
Aranyak Mehta
,
Yuval Rabani
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 547-556
Approximating directed multicuts
Joseph Cheriyan
,
Howard Karloff
,
Yuval Rabani
Combinatorica
25
(3), 2005, pp. 251-269
OPT versus LOAD in dynamic storage allocation
Adam L. Buchsbaum
,
Howard Karloff
,
Claire Kenyon
,
Nick Reingold
,
Mikkel Thorup
SIAM Journal on Computing
33
(3), 2004, pp. 632-646
Approximation algorithms for the
0
-extension problem
Gruia Calinescu
,
Howard Karloff
,
Yuval Rabani
SIAM Journal on Computing
34
(2), 2004-2005, pp. 358-372
OPT versus LOAD in dynamic storage allocation
Adam L. Buchsbaum
,
Howard Karloff
,
Claire Kenyon
,
Nick Reingold
,
Mikkel Thorup
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 556-564
A new approximation algorithm for finding heavy planar subgraphs
Gruia Cȃlinescu
,
Cristina G. Fernandes
,
Howard Karloff
,
Alexander Zelikovsky
Algorithmica
36
(2), 2003, pp. 179-205
On the fractal behavior of TCP
Anna Gilbert
,
Howard Karloff
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 297-306
Thresholds and optimal binary comparison search trees
Richard Anderson
,
Sampath Kannan
,
Howard Karloff
,
Richard E. Ladner
Journal of Algorithms
44
(2), 2002, pp. 338-358
Improved approximation algorithms for resource allocation
Gruia Calinescu
,
Amit Chakrabarti
,
Howard Karloff
,
Yuval Rabani
Lecture Notes in Computer Science
2337
, 2002, pp. 401-414
Thresholds and optimal binary comparison search trees
Richard Anderson
,
Sampath Kannan
,
Howard Karloff
,
Richard E. Ladner
Lecture Notes in Computer Science
2245
, 2001, pp. 83-95
Lower bounds for linear locally decodable codes and private information retrieval
Oded Goldreich
,
Howard Karloff
,
Leonard Schulman
,
Luca Trevisan
Technical Report (TR01-080), 2001
A decomposition theorem for task systems and bounds for randomized server problems
Avrim Blum
,
Howard Karloff
,
Yuval Rabani
,
Michael Saks
SIAM Journal on Computing
30
(5), 2000, pp. 1624-1661
A lower bound of
8/(7+\frac{1}{k-1}
on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut
Ari Freund
,
Howard Karloff
Information Processing Letters
75
(1-2), 2000, pp. 43-50
An improved approximation algorithm for
\sc Multiway
\sc Cut
Gruia Gălinescu
,
Howard Karloff
,
Yuval Rabani
Journal of Computer and System Sciences
60
(3), 2000, pp. 564-574
New results on the old
k
-opt algorithm for the Traveling Salesman Problem
Barun Chandra
,
Howard Karloff
,
Craig Tovey
SIAM Journal on Computing
28
(6), 1999, pp. 1998-2029
Seiten 1
2
3
>