Result 1 to 11 of 11 total
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs. (English)
Algorithmica 63, No. 1-2, 425-456 (2012).
1
Domination in graphs with bounded propagation: Algorithms, formulations and hardness results. (English)
J. Comb. Optim. 19, No. 4, 429-456 (2010).
2
io-port 05754737 Harsha, Prahladh;
Charikar, Moses;
Andrews, Matthew;
Arora, Sanjeev;
Khot, Subhash;
Moshkovitz, Dana;
Zhang, Lisa;
Aazami, Ashkan;
Desai, Dev;
Gorodezky, Igor;
Jagannathan, Geetha;
Kulikov, Alexander S.;
Mir, Darakhshan J.;
Newman, Alantha;
Nikolov, Aleksandar;
Pritchard, David;
Spencer, Gwen
Limits of approximation algorithms: pcps and unique games (DIMACS tutorial lecture notes). (English)
Comput. Res. Repos. 2010, Article No. 1002.3864 (2010).
3
Approximation algorithms and hardness for domination with propagation. (English)
SIAM J. Discrete Math. 23, No. 3, 1382-1399 (2009).
4
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs. (English)
Dinur, Irit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03684-2/pbk). Lecture Notes in Computer Science 5687, 1-14 (2009).
5
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (English)
APPROX-RANDOM, 1-14 (2009).
6
Domination in graphs with bounded propagation: Algorithms, formulations and hardness results. (English)
Comput. Res. Repos. 2008, Article No. 0802.2130 (2008).
7
Approximation algorithms and hardness for domination with propagation. (English)
Charikar, Moses (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20‒22, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74207-4/pbk). Lecture Notes in Computer Science 4627, 1-15 (2007).
8
Approximation algorithms and hardness for domination with propagation. (English)
Comput. Res. Repos. 2007, Article No. 0710.2139 (2007).
9
Approximation algorithms and hardness for domination with propagation (English)
APPROX-RANDOM, 1-15 (2007).
10
Near optimal number of replicas for continuous media in ad-hoc networks of wireless devices (English)
Multimedia Information Systems, 40-49 (2004).
11
Result 1 to 11 of 11 total
Start
Contact
Print
General Help
