Result 1 to 20 of 160 total
Prize-collecting survivable network design in node-weighted graphs. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 98-109 (2012).
1
Online scheduling to minimize maximum response time and maximum delay factor. (English)
Theory Comput. 8, Paper No. 7, 165-195, electronic only (2012).
2
Pruning 2-connected graphs. (English)
Algorithmica 62, No. 1-2, 436-463 (2012).
3
Maximizing a monotone submodular function subject to a matroid constraint. (English)
SIAM J. Comput. 40, No. 6, 1740-1766 (2011).
4
Submodular function maximization via the multilinear relaxation and contention resolution schemes. (English)
Comput. Res. Repos. 2011, Article No. 1105.4593 (2011).
5
Approximation algorithms for submodular multiway partition. (English)
Comput. Res. Repos. 2011, Article No. 1105.2048 (2011).
6
Submodular cost allocation problem and applications. (English)
Comput. Res. Repos. 2011, Article No. 1105.2040 (2011).
7
Submodular cost allocation problem and applications. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 354-366 (2011).
8
Approximability of capacitated network design. (English)
Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 78-91 (2011).
9
Buy-at-bulk network design with protection. (English)
Math. Oper. Res. 36, No. 1, 71-87 (2011).
10
New models and algorithms for throughput maximization in broadcast scheduling (extended abstract). (English)
Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9‒10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 71-82 (2011).
11
Set connectivity problems in undirected graphs and the directed Steiner network problem (English)
ACM Transactions on Algorithms 7, No. 2, 18 (2011).
12
Buy-at-bulk network design with protection (English)
Math. Oper. Res. 36, No. 1, 71-87 (2011).
13
Prize-collecting Steiner problems on planar graphs (English)
SODA, 1028-1049 (2011).
14
Multi-budgeted matchings and matroid intersection via dependent rounding (English)
SODA, 1080-1097 (2011).
15
Submodular cost allocation problem and applications (English)
ICALP (1), 354-366 (2011).
16
Approximability of capacitated network design (English)
IPCO, 78-91 (2011).
17
Submodular function maximization via the multilinear relaxation and contention resolution schemes (English)
STOC, 783-792 (2011).
18
Approximation algorithms for nonuniform buy-at-bulk network design. (English)
SIAM J. Comput. 39, No. 5, 1772-1798 (2010).
19
Prize-collecting Steiner tree and forest in planar graphs. (English)
Comput. Res. Repos. 2010, Article No. 1006.4357 (2010).
20
Result 1 to 20 of 160 total
Start
Contact
Print
General Help
