Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal-stretch name-independent compact routing in doubling metrics. Invited for publication in special issue of ACM Transactions on Algorithms dedicated to best papers of SODA 2007; combination of papers from PODC 2006 and SODA 2007; submitted, 2007. [ bib | .pdf ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia. Dynamic routing and location services in metrics of low doubling dimension. In Proceedings of the 22nd DISC, volume 5218 of Lecture Notes in Computer Science, pages 379-393, 2008. [ bib | .pdf ]

Sushu Zhang, Karam S. Chatha, and Goran Konjevod. Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. In ISLPED '07: Proceedings of the 2007 international symposium on Low power electronics and design, pages 225-230, 2007. [ bib | DOI | .pdf ]

Goran Konjevod, Andrea Richa, Donglin Xia, and Hai Yu. Compact routing with slack in low doubling dimension. In Proceedings of the 26th PODC, pages 71-80, 2007. [ bib | DOI | .pdf ]

Krisnan Srinivasan, Karam S. Chatha, and Goran Konjevod. Application specific network-on-chip design with guaranteed quality approximation algorithms. In Proceedings of ASP-DAC, 2007. [ bib | .pdf ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal scale-free compact routing schemes in networks of low doubling dimension. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 939-948, 2007. [ bib | .ps.gz ]

T.-H. Hubert Chan, Donglin Xia, Goran Konjevod, and Andréa W. Richa. A tight lower bound for Steiner point removal problem on trees. In Proceedings of the APPROX, volume 4110 of Lecture Notes in Computer Science, pages 70-81, 2006. [ bib | .pdf ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal-stretch name-independent compact routing in doubling metrics. In Proceedings of the 25th PODC, pages 198-207, 2006. [ bib | .ps.gz ]

Goran Konjevod. Directed Steiner trees, linear programs and randomized rounding. Manuscript, 8 pages, 2005. [ bib | .ps.gz ]

Goran Konjevod, Sven O. Krumke, and Madhav V. Marathe. Budget constrained minimum cost connected medians. J. Discrete Algorithms, 2(4):453-469, 2004. [ bib | .ps.gz ]

Jochen Könemann, Goran Konjevod, Ojas Parekh, and Amitabh Sinha. Improved approximations for tour and tree covers. Algorithmica, 38(3):441-449, 2003. [ bib | .pdf ]

Goran Konjevod, R. Ravi, and Aravind Srinivasan. Approximation algorithms for the covering Steiner problem. Random Struct. Algorithms, 20(3):465-482, 2002. [ bib | .ps.gz ]

Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, and Amitabh Sinha. On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem. In Proceedings of the 8th IPCO, pages 170-184, 2001. [ bib | .ps.gz ]

Robert D. Carr, Toshihiro Fujito, Goran Konjevod, and Ojas Parekh. A 2(1)/(10)-approximation algorithm for a generalization of the weighted edge-dominating set problem. J. Comb. Optim., 5(3):317-326, 2001. [ bib | .ps.gz ]

Jochen Könemann, Goran Konjevod, Ojas Parekh, and Amitabh Sinha. Improved approximations for tour and tree covers. In Proceedings of the 3rd Approx, volume 1913 of Lecture Notes in Computer Science, pages 184-193, 2000. [ bib | .ps.gz ]

Robert D. Carr, Toshihiro Fujito, Goran Konjevod, and Ojas Parekh. A 2(1)/(10)-approximation algorithm for a generalization of the weighted edge-dominating set problem. In Proceedings of the 8th ESA, volume 1879 of Lecture Notes in Computer Science, pages 132-142, 2000. [ bib | .ps.gz ]

Goran Konjevod, Sven O. Krumke, and Madhav V. Marathe. Budget constrained minimum cost connected medians. In Proceedings of the 26th WG, volume 1928 of Lecture Notes in Computer Science, pages 267-278, 2000. [ bib | .ps.gz ]

Goran Konjevod and R. Ravi. An approximation algorithm for the covering Steiner problem. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 338-344, 2000. [ bib | .ps.gz ]

Robert D. Carr, Srinivas Doddi, Goran Konjevod, and Madhav V. Marathe. On the red-blue set cover problem. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 345-353, 2000. [ bib | .ps.gz ]

Avrim Blum, Goran Konjevod, R. Ravi, and Santosh Vempala. Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor. Comput. Sci., 235(1):25-42, 2000. [ bib | .ps.gz ]

Naveen Garg, Goran Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms, 37:66-84, 2000. [ bib | .ps.gz ]

Avrim Blum, Goran Konjevod, R. Ravi, and Santosh Vempala. Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 100-105, 1998. [ bib | .ps.gz ]

Naveen Garg, Goran Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group Steiner tree problem. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 253-259, 1998. [ bib | .ps.gz ]


This file was generated by bibtex2html 1.91.