@UNPUBLISHED{konjevodetal:dyn-07,
AUTHOR = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
TITLE = {Dynamic routing in metrics with low doubling dimension},
YEAR = {2007},
CATID1 = {submitted.paper},
CATID1 = {distributed.paper},
CATID1 = {approx.paper},
CATID1 = {selected.paper},
URL = {dynamic-routing.pdf}
}
@UNPUBLISHED{konjevodetal:talg-xx,
AUTHOR = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
TITLE = {Optimal-stretch name-independent compact routing
in doubling metrics},
NOTE = {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},
CATID1 = {submitted.paper},
CATID1 = {selected.paper},
CATID1 = {approx.paper},
CATID1 = {distributed.paper},
URL = {talg-routing07.pdf},
YEAR = {2007}
}
@INPROCEEDINGS{konjevodetal:podc-07,
AUTHOR = {Goran Konjevod and Andrea Richa and Donglin Xia and Hai Yu},
TITLE = {Compact routing with slack in low doubling dimension},
BOOKTITLE = {Proceedings of the 26th PODC},
YEAR = {2007},
ISBN = {978-1-59593-616-5},
PAGES = {71--80},
LOCATION = {Portland, Oregon, USA},
DOI = {http://doi.acm.org/10.1145/1281100.1281113},
CATID1 = {conference.paper},
CATID1 = {distributed.paper},
CATID1 = {approx.paper},
CATID1 = {selected.paper},
URL = {podc07.pdf}
}
@INPROCEEDINGS{srinivasanetal:aspdac-07,
AUTHOR = {Krisnan Srinivasan and Karam S. Chatha
and Goran Konjevod},
TITLE = {Application Specific Network-on-Chip Design with
Guaranteed Quality Approximation Algorithms},
BOOKTITLE = {Proceedings of ASP-DAC},
YEAR = {2007},
CATID1 = {conference.paper},
CATID1 = {approx.paper},
CATID1 = {polyhedral.paper},
CATID1 = {cad.paper},
URL = {noc-aspdac07.pdf}
}
@INPROCEEDINGS{konjevodetal:soda-07,
AUTHOR = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
TITLE = {Optimal scale-free compact routing schemes in networks
of low doubling dimension},
BOOKTITLE = {Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms},
PAGES = {939--948},
URL = {06scalefree.ps.gz},
CATID1 = {conference.paper},
CATID1 = {selected.paper},
CATID1 = {approx.paper},
CATID2 = {c.approx},
CATID1 = {distributed.paper},
YEAR = {2007}
}
@INPROCEEDINGS{chanetal:steiner-06,
AUTHOR = {T.-H. Hubert Chan and Donglin Xia and Goran Konjevod
and Andr\'{e}a W. Richa},
TITLE = {A tight lower bound for {S}teiner point removal problem
on trees},
BOOKTITLE = {Proceedings of the APPROX},
SERIES = {Lecture Notes in Computer Science},
VOLUME = 4110,
PAGES = {70--81},
YEAR = {2006},
CATID1 = {conference.paper},
CATID1 = {approx.paper},
CATID1 = {metric.paper},
URL = {steinerremoval.pdf}
}
@INPROCEEDINGS{konjevodetal:podc-06,
AUTHOR = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
TITLE = {Optimal-stretch name-independent compact routing
in doubling metrics},
BOOKTITLE = {Proceedings of the 25th PODC},
PAGES = {198--207},
URL = {routing-podc06.ps.gz},
CATID1 = {conference.paper},
CATID1 = {selected.paper},
CATID1 = {approx.paper},
CATID1 = {distributed.paper},
YEAR = {2006}
}
@UNPUBLISHED{konjevod:dst-05,
AUTHOR = {Goran Konjevod},
TITLE = {Directed {S}teiner trees, linear programs and
randomized rounding},
YEAR = {2005},
NOTE = {Manuscript, 8 pages},
CATID1 = {approx.paper},
CATID1 = {polyhedral.paper},
URL = {dst.ps.gz}
}
@ARTICLE{konjevodetal:jda-04,
AUTHOR = {Goran Konjevod and Sven O. Krumke and Madhav V. Marathe},
TITLE = {Budget constrained minimum cost connected medians},
JOURNAL = {J. Discrete Algorithms},
VOLUME = {2},
NUMBER = {4},
PAGES = {453--469},
YEAR = {2004},
CATID1 = {journal.paper},
CATID1 = {approx.paper},
CATID2 = {c.approx},
URL = {conmed.ps.gz}
}
@ARTICLE{koenemannetal:algorithmica-03,
AUTHOR = {Jochen K\"{o}nemann and Goran Konjevod and
Ojas Parekh and Amitabh Sinha},
TITLE = {Improved Approximations for Tour and Tree Covers},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {3},
PAGES = {441--449},
YEAR = {2003},
CATID1 = {approx.paper},
CATID1 = {journal.paper},
CATID1 = {polyhedral.paper},
URL = {tc.pdf}
}
@ARTICLE{konjevodetal:rsa-02,
AUTHOR = {Goran Konjevod and R. Ravi and Aravind Srinivasan},
TITLE = {Approximation algorithms for the covering {S}teiner problem},
JOURNAL = {Random Struct. Algorithms},
VOLUME = {20},
NUMBER = {3},
PAGES = {465-482},
YEAR = {2002},
CATID1 = {selected.paper},
CATID1 = {journal.paper},
CATID1 = {approx.paper},
URL = {cst.ps.gz}
}
@INPROCEEDINGS{gargetal:ipco-01,
AUTHOR = {Naveen Garg and Rohit Khandekar and Goran Konjevod
and R. Ravi and F. Sibel Salman and Amitabh Sinha},
TITLE = {On the Integrality Gap of a Natural Formulation of the Single-Sink
Buy-at-Bulk Network Design Problem},
BOOKTITLE = {Proceedings of the 8th IPCO},
YEAR = {2001},
PAGES = {170--184},
CATID1 = {approx.paper},
CATID1 = {conference.paper},
CATID1 = {polyhedral.paper},
URL = {dd.ps.gz}
}
@ARTICLE{carretal:jco-01,
AUTHOR = {Robert D. Carr and Toshihiro Fujito and Goran Konjevod
and Ojas Parekh},
TITLE = {A 2$\frac{1}{10}$-Approximation Algorithm for a Generalization
of the Weighted Edge-Dominating Set Problem},
JOURNAL = {J. Comb. Optim.},
VOLUME = {5},
NUMBER = {3},
PAGES = {317--326},
YEAR = {2001},
CATID1 = {approx.paper},
CATID1 = {journal.paper},
CATID1 = {polyhedral.paper},
URL = {eds.ps.gz}
}
@INPROCEEDINGS{koenemannetal:approx-00,
AUTHOR = {Jochen K\"{o}nemann and Goran Konjevod and
Ojas Parekh and Amitabh Sinha},
TITLE = {Improved Approximations for Tour and Tree Covers},
BOOKTITLE = {Proceedings of the 3rd Approx},
PAGES = {184--193},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1913},
YEAR = {2000},
CATID1 = {conference.paper},
CATID1 = {approx.paper},
CATID1 = {polyhedral.paper},
URL = {tc.ps.gz}
}
@INPROCEEDINGS{carretal:esa-00,
AUTHOR = {Robert D. Carr and Toshihiro Fujito and Goran Konjevod
and Ojas Parekh},
TITLE = {A 2$\frac{1}{10}$-Approximation Algorithm for a Generalization
of the Weighted Edge-Dominating Set Problem},
BOOKTITLE = {Proceedings of the 8th ESA},
SERIES = {Lecture Notes in Computer Science},
VOLUME = 1879,
PAGES = {132--142},
YEAR = {2000},
CATID1 = {conference.paper},
CATID1 = {approx.paper},
CATID1 = {polyhedral.paper},
URL = {eds-proc.ps.gz}
}
@INPROCEEDINGS{konjevodetal:wg-00,
AUTHOR = {Goran Konjevod and Sven O. Krumke and Madhav V. Marathe},
TITLE = {Budget constrained minimum cost connected medians},
BOOKTITLE = {Proceedings of the 26th WG},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1928},
PAGES = {267--278},
YEAR = {2000},
CATID1 = {conference.paper},
CATID1 = {approx.paper},
URL = {conmed-proc.ps.gz}
}
@INPROCEEDINGS{konjevodravi:soda-00,
AUTHOR = {Goran Konjevod and R. Ravi},
TITLE = {An approximation algorithm for the covering {S}teiner problem},
BOOKTITLE = {Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms},
YEAR = {2000},
PAGES = {338--344},
CATID1 = {conference.paper},
CATID1 = {approx.paper},
URL = {cst-proc.ps.gz}
}
@INPROCEEDINGS{carretal:soda-00rb,
AUTHOR = {Robert D. Carr and Srinivas Doddi and Goran Konjevod and
Madhav V. Marathe},
TITLE = {On the red-blue set cover problem},
BOOKTITLE = {Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms},
PAGES = {345--353},
YEAR = {2000},
CATID1 = {selected.paper},
CATID1 = {conference.paper},
CATID1 = {approx.paper},
CATID1 = {polyhedral.paper},
URL = {rb-proc.ps.gz}
}
@ARTICLE{blumetal:tcs-00,
AUTHOR = {Avrim Blum and Goran Konjevod and R. Ravi and Santosh Vempala},
TITLE = {Semi-definite relaxations for minimum bandwidth and other
vertex-ordering problems},
JOURNAL = {Theor. Comput. Sci.},
VOLUME = {235},
NUMBER = {1},
PAGES = {25--42},
YEAR = {2000},
CATID1 = {journal.paper},
CATID1 = {approx.paper},
URL = {bw.ps.gz}
}
@ARTICLE{gargetal:jalg-00,
AUTHOR = {Naveen Garg and Goran Konjevod and R. Ravi},
TITLE = {A polylogarithmic approximation algorithm for the group {S}teiner tree
problem},
JOURNAL = {J. Algorithms},
VOLUME = {37},
YEAR = {2000},
PAGES = {66--84},
CATID1 = {selected.paper},
CATID1 = {journal.paper},
CATID1 = {approx.paper},
URL = {gst.ps.gz}
}
@INPROCEEDINGS{blumetal:stoc-98,
AUTHOR = {Avrim Blum and Goran Konjevod and R. Ravi and Santosh Vempala},
TITLE = {Semi-definite relaxations for minimum bandwidth and other
vertex-ordering problems},
BOOKTITLE = {Proceedings of the 30th Annual ACM Symposium on Theory of Computing},
PAGES = {100--105},
YEAR = {1998},
CATID1 = {conference.paper},
CATID1 = {approx.paper},
URL = {bw-proc.ps.gz}
}
@INPROCEEDINGS{gargetal:soda-98,
AUTHOR = {Naveen Garg and Goran Konjevod and R. Ravi},
TITLE = {A polylogarithmic approximation algorithm for the group {S}teiner tree
problem},
BOOKTITLE = {Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms},
YEAR = {1998},
PAGES = {253--259},
CATID1 = {approx.paper},
CATID1 = {conference.paper},
URL = {gst-proc.ps.gz}
}
This file has been generated by bibtex2html 1.84.