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
[2]
Hilfe
Suche: Author="Ward, Justin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Submodular stochastic probing on matroids
Marek Adamczyk
,
Maxim Sviridenko
,
Justin Ward
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 29-40
Monotone submodular maximization over a matroid via non-oblivious local search
Yuval Filmus
,
Justin Ward
SIAM Journal on Computing
43
(2), 2014, pp. 514-542
Large neighborhood local search for the maximum set packing problem
Maxim Sviridenko
,
Justin Ward
Lecture Notes in Computer Science
7965
, 2013, pp. 792-803
The power of local search: Maximum coverage over a matroid
Yuval Filmus
,
Justin Ward
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 601-612
A
(k+3)/2
-approximation algorithm for monotone submodular
k
-set packing and general
k
-exchange systems
Justin Ward
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 42-53
Improved approximations for
k
-exchange systems
Moran Feldman
,
Joseph (Seffi) Naor
,
Roy Schwartz
,
Justin Ward
Lecture Notes in Computer Science
6942
, 2011, pp. 784-798