Result 1 to 20 of 68 total
New approximation algorithms for the unsplittable capacitated facility location problem. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 237-248 (2012).
1
On minimum sum of radii and diameters clustering. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 71-82 (2012).
2
A weakly robust PTAS for minimum clique partition in unit disk graphs. (English)
Algorithmica 62, No. 3-4, 1050-1072 (2012).
3
A constant factor approximation for minimum $λ$-edge-connected $k$-subgraph with metric costs. (English)
SIAM J. Discrete Math. 25, No. 3, 1089-1102 (2011).
4
Improved approximations for buy-at-bulk and shallow-light $k$-Steiner trees and $(k,2)$-subgraph. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 20-29 (2011).
5
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems. (English)
Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 302-314 (2011).
6
Approximability of packing disjoint cycles. (English)
Algorithmica 60, No. 2, 395-400 (2011).
7
Minimizing movement in mobile facility location problems (English)
ACM Transactions on Algorithms 7, No. 3, 28 (2011).
8
Improved approximation algorithms for the min-Max tree cover and bounded tree cover problems (English)
APPROX-RANDOM, 302-314 (2011).
9
Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph (English)
ISAAC, 20-29 (2011).
10
Approximation algorithms for nonuniform buy-at-bulk network design. (English)
SIAM J. Comput. 39, No. 5, 1772-1798 (2010).
11
A weakly robust PTAS for minimum clique partition in unit disk graphs. (Extended abstract). (English)
Kaplan, Haim (ed.), Algorithm theory ‒ SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 188-199 (2010).
12
Asymmetric traveling salesman path and directed latency problems (English)
SODA, 419-428 (2010).
13
A weakly robust PTAS for minimum clique partition in unit disk graphs (English)
SWAT, 188-199 (2010).
14
Asymmetric traveling salesman path and directed latency problems. (English)
Comput. Res. Repos. 2009, Article No. 0907.0726 (2009).
15
A PTAS for minimum clique partition in unit disk graphs. (English)
Comput. Res. Repos. 2009, Article No. 0904.2203 (2009).
16
Survivable network design with degree or order constraints. (English)
SIAM J. Comput. 39, No. 3, 1062-1087 (2009).
17
Approximating buy-at-bulk and shallow-light $k$-Steiner trees. (English)
Algorithmica 53, No. 1, 89-103 (2009).
18
A logarithmic approximation for unsplittable flow on line graphs (English)
SODA, 702-709 (2009).
19
Combination can be hard: Approximability of the unique coverage problem. (English)
SIAM J. Comput. 38, No. 4, 1464-1483 (2008).
20
Result 1 to 20 of 68 total
Start
Contact
Print
General Help
