@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:disc-08,
author = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
title = {Dynamic routing and location services in metrics of
low doubling dimension},
booktitle = {Proceedings of the 22nd DISC},
series = {Lecture Notes in Computer Science},
volume = {5218},
year = {2008},
pages = {379--393},
catid1 = {conference.paper},
catid1 = {distributed.paper},
catid1 = {approx.paper},
catid1 = {selected.paper},
url = {dynamic-routing.pdf}
}
@inproceedings{zhangetal:islped-07,
author = {Sushu Zhang and Karam S. Chatha and Goran Konjevod},
title = {Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules},
booktitle = {ISLPED '07: Proceedings of the 2007 international symposium on Low power electronics and design},
year = {2007},
pages = {225--230},
doi = {http://doi.acm.org/10.1145/1283780.1283828},
catid1 = {conference.paper},
catid1 = {approx.paper},
catid1 = {cad.paper},
url = {islped07.pdf}
}
@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 was generated by bibtex2html 1.91.