Result 1 to 20 from 55 total
Maximizing a monotone submodular function subject to a matroid constraint. (English)
SIAM J. Comput. 40, No. 6, 1740-1766 (2011).
1
Maximizing non-monotone submodular functions. (English)
SIAM J. Comput. 40, No. 4, 1133-1153 (2011).
2
On variants of the matroid secretary problem. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 335-346 (2011).
3
Submodular function maximization via the multilinear relaxation and contention resolution schemes. (English)
Comput. Res. Repos. 2011, Article No. 1105.4593 (2011).
4
On variants of the matroid secretary problem. (English)
Comput. Res. Repos. 2011, Article No. 1104.4081 (2011).
5
On variants of the matroid secretary problem (English)
ESA, 335-346 (2011).
6
Multi-budgeted matchings and matroid intersection via dependent rounding (English)
SODA, 1080-1097 (2011).
7
Submodular maximization by simulated annealing (English)
SODA, 1098-1116 (2011).
8
Measurement and processing of relaxation times T1 and T2 during the UV polymerization process (English)
TSP, 385-390 (2011).
9
Is submodularity testable? (English)
ICS, 195-210 (2011).
10
Maximizing conjunctive views in deletion propagation (English)
PODS, 187-198 (2011).
11
Submodular function maximization via the multilinear relaxation and contention resolution schemes (English)
STOC, 783-792 (2011).
12
A randomized embedding algorithm for trees. (English)
Combinatorica 30, No. 4, 445-470 (2010).
13
The submodular welfare problem with demand queries. (English)
Theory Comput. 6, Paper No. 11, 247-290, electronic only (2010).
14
Submodularity and curvature: the optimal algorithm. (English)
RIMS Kôkyûroku Bessatsu B23, 253-266 (2010).
15
Submodular maximization over multiple matroids via generalized exchange properties. (English)
Math. Oper. Res. 35, No. 4, 795-806 (2010).
16
A note on concentration of submodular functions. (English)
Comput. Res. Repos. 2010, Article No. 1005.2791 (2010).
17
The submodular welfare problem with demand queries (English)
Theory of Computing 6, No. 1, 247-290 (2010).
18
Submodular maximization over multiple matroids via generalized exchange properties (English)
Math. Oper. Res. 35, No. 4, 795-806 (2010).
19
Dependent randomized rounding via exchange properties of combinatorial structures (English)
FOCS, 575-584 (2010).
20
Result 1 to 20 from 55 total
Start
Contact
Print
General Help
