@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}
}
@UNPUBLISHED{carretal:talg-xx,
AUTHOR = {Robert D. Carr and Goran Konjevod and Danny Greg Little
and Venkatesh Natarajan and Ojas D. Parekh},
TITLE = {Compacting cuts: a new linear formulation for minimum cut},
NOTE = {Invited for publication in special issue of
ACM Transactions on Algorithms dedicated to best papers of SODA 2007;
submitted},
YEAR = {2007},
CATID1 = {submitted.paper},
CATID1 = {polyhedral.paper},
URL = {talg-cuts.pdf}
}
@UNPUBLISHED{konjevod:encyclopedia-07,
AUTHOR = {Goran Konjevod},
TITLE = {Separators ({L}eighton-{R}ao)},
NOTE = {Entry invited for Encyclopedia of Algorithms, edited by M.-Y. Kao},
BOOKTITLE = {Encyclopedia of Algorithms},
CHAPTER = {xx},
EDITOR = {Ming-Yang Kao},
CATID1 = {submitted.paper},
URL = {separators.pdf},
YEAR = 2007
}
@UNPUBLISHED{kiersteadkonjevod:ramsey-05,
AUTHOR = {Henry A. Kierstead and Goran Konjevod},
TITLE = {Coloring number and on-line {R}amsey theory for
graphs and hypergraphs},
NOTE = {Accepted for publication in Combinatorica, September 2007. 11 pages.},
YEAR = {2005},
CATID1 = {ramsey.paper},
CATID1 = {submitted.paper},
CATID1 = {selected.paper},
URL = {051231-sub-combinatorica.ps.gz}
}
@UNPUBLISHED{konjevod:4osme-07,
AUTHOR = {Goran Konjevod},
TITLE = {Integer programming models for flat origami},
NOTE = {Accepted for publication in proceedings
of 4OSME: 4th International Conference on Origami
Science, Mathematics and Education, 9 pages},
YEAR = {2006},
CATID1 = {selected.paper},
CATID1 = {submitted.paper},
CATID1 = {origami},
CATID1 = {other.paper},
HTTP = {4osme.mod},
URL = {4osme.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{gowdaetal:ecctd-07,
TITLE = {Synthesis of Threshold Logic Circuits Using Tree Matching},
AUTHOR = {Tejaswi Gowda and
Samuel Leshner and
Sarma B. K. Vrudhula and
Goran Konjevod},
BOOKTITLE = {Proceedings of the 18th European Conference on Circuit Theory and Design},
YEAR = {2007},
CATID1 = {conference.paper},
CATID1 = {cad.paper},
URL = {2007 ecctd matching.pdf}
}
@INPROCEEDINGS{gowdaetal:glsvlsi-07,
AUTHOR = {Tejaswi Gowda and
Sarma B. K. Vrudhula and
Goran Konjevod},
TITLE = {Combinational equivalence checking for threshold logic
circuits.},
BOOKTITLE = {ACM Great Lakes Symposium on VLSI},
YEAR = {2007},
PAGES = {102-107},
EE = {http://doi.acm.org/10.1145/1228784.1228813},
BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
CATID1 = {conference.paper},
CATID1 = {cad.paper},
URL = {2007 glsvlsi thresholdequiv.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{ostleretal:aspdac-07,
AUTHOR = {Chris Ostler and Karam S. Chatha
and Goran Konjevod},
TITLE = {Application Throughput Maximization on
Network Processor Architectures},
BOOKTITLE = {Proceedings of ASP-DAC},
CATID1 = {conference.paper},
CATID1 = {cad.paper},
YEAR = 2007,
URL = {throughput-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{carretal:soda-07,
AUTHOR = {Robert D. Carr and Goran Konjevod and Danny Greg Little
and Venkatesh Natarajan and Ojas D. Parekh},
TITLE = {Compacting cuts: a new linear formulation for minimum cut},
BOOKTITLE = {Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms},
YEAR = {2007},
CATID1 = {conference.paper},
CATID1 = {selected.paper},
CATID1 = {polyhedral.paper},
URL = {mincut.ps.gz}
}
@ARTICLE{bazzikonjevod:dc-06,
AUTHOR = {Rida A. Bazzi and Goran Konjevod},
TITLE = {On the establishment of distinct identities in overlay networks},
NOTE = {Special issue with best papers of PODC 2005},
JOURNAL = {Distributed Computing},
VOLUME = {19},
NUMBER = {4},
PAGES = {267--287},
YEAR = {2007},
CATID1 = {selected.paper},
CATID1 = {distributed.paper},
CATID1 = {journal.paper},
URL = {dc06.pdf}
}
@ARTICLE{joshietal:jut-06,
AUTHOR = {Himanshu Joshi and
Subhrajit Guhathakurta and
Goran Konjevod and
John Crittenden and
Ke Li},
TITLE = {Simulating impact of light rail on urban growth in {P}hoenix:
an application of the {U}rban{S}im modeling environment.},
JOURNAL = {Journal of Urban Technology},
YEAR = {2006},
PAGES = {91--111},
CATID1 = {journal.paper},
CATID1 = {sim.paper},
URL = {CJUT_A_187137_0.pdf},
CATID1 = {other.paper}
}
@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}
}
@INPROCEEDINGS{joshietal:dgo-06,
AUTHOR = {Himanshu Joshi and
Subhrajit Guhathakurta and
Goran Konjevod and
John Crittenden and
Ke Li},
TITLE = {Simulating impact of light rail on urban growth in Phoenix:
an application of urbansim modeling environment.},
BOOKTITLE = {Proceedings of the 7th Annual International Conference on
Digital Government Research, DG.O 2006},
YEAR = {2006},
CATID1 = {conference.paper},
CATID1 = {sim.paper},
PAGES = {135-141},
CATID1 = {other.paper}
}
@ARTICLE{srinivasanetal:tvlsi-06,
AUTHOR = {Krishnan Srinivasan and Karam S. Chatha and Goran Konjevod},
TITLE = {Linear-programming-based techniques for synthesis of
network-on-chip architectures},
JOURNAL = {IEEE Trans. VLSI Syst.},
VOLUME = {14},
NUMBER = {4},
PAGES = {407-420},
YEAR = {2006},
CATID1 = {journal.paper},
CATID1 = {cad.paper},
URL = {tvlsi05.pdf}
}
@ARTICLE{carretal:mpb-06,
AUTHOR = {Robert D. Carr and William E. Hart and Harvey J. Greenberg
and Goran Konjevod and Erik Lauer and Henry Lin and Tod Morrison
and Cynthia A. Phillips},
TITLE = {Robust Optimization of Contaminant Sensor Placement
for Community Water Systems},
JOURNAL = {Math. Programming, Ser. B},
VOLUME = {107},
NUMBER = {1-2},
YEAR = {2006},
PAGES = {337-356},
CATID1 = {journal.paper},
CATID1 = {polyhedral.paper},
NOTE = {Special issue on Robust Optimization},
URL = {robustopt05.pdf}
}
@INPROCEEDINGS{konjevodetal:latin-06,
AUTHOR = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
TITLE = {On sampling in higher-dimensional peer-to-peer systems},
BOOKTITLE = {Proceedings of the 9th LATIN},
YEAR = {2006},
PAGES = {641--652},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3887},
CATID1 = {conference.paper},
CATID1 = {distributed.paper},
URL = {latin06.pdf}
}
@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{ohetal:tbroadcasting-05,
AUTHOR = {Soohyun Oh and Yo Huh and Beshlan Kulapala and
Goran Konjevod and Andr\'{e}a W. Richa and Martin Reisslein},
TITLE = {A modular algorithm-theoretic framework for the
fair and efficient collaborative prefetching of continuous media},
JOURNAL = {IEEE Transactions on Broadcasting},
VOLUME = 51,
NUMBER = 2,
PAGES = {200--215},
YEAR = 2005,
CATID1 = {journal.paper},
URL = {OhKKRR_TB05.pdf},
CATID1 = {other.paper}
}
@INPROCEEDINGS{srinivasanetal:iccad-05,
AUTHOR = {Krishnan Srinivasan and Karam S. Chatha and Goran Konjevod},
TITLE = {An Automated Technique for Topology and Route Generation
of Application Specific On-Chip Interconnection Networks},
BOOKTITLE = {Proceedings of the ICCAD},
YEAR = {2005},
PAGES = {},
CATID1 = {conference.paper},
CATID1 = {polyhedral.paper},
CATID1 = {cad.paper},
URL = {ICCAD05.pdf}
}
@INPROCEEDINGS{bazzikonjevod:podc-05,
AUTHOR = {Rida A. Bazzi and Goran Konjevod},
TITLE = {On the establishment of distinct identities in overlay networks},
BOOKTITLE = {Proceedings of the 24th PODC},
PAGES = {312--320},
YEAR = 2005,
CATID1 = {conference.paper},
CATID1 = {distributed.paper},
URL = {podc05.ps.gz}
}
@INCOLLECTION{carrkonjevod:poly-04,
AUTHOR = {Robert D. Carr and Goran Konjevod},
EDITOR = {Harvey Greenberg},
BOOKTITLE = {Tutorials on emerging methodologies and applications
in Operations Research},
CHAPTER = {2},
TITLE = {Polyhedral Combinatorics},
PUBLISHER = {Springer},
YEAR = {2004},
PAGES = {(2-1)--(2-48)},
CATID1 = {polyhedral.paper},
CATID1 = {bookchapter},
CATID1 = {selected.paper},
URL = {Chapter2.pdf}
}
@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}
}
@INPROCEEDINGS{bazzikonjevod:disc-04,
AUTHOR = {Rida A. Bazzi and Goran Konjevod},
TITLE = {Efficient Verification for Provably Secure Storage
and Secret Sharing in Systems Where Half the Servers Are Faulty},
BOOKTITLE = {Proceedings of the 18th DISC},
YEAR = {2004},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3274},
PAGES = {420--434},
CATID1 = {conference.paper},
CATID1 = {distributed.paper},
URL = {disc04.pdf}
}
@UNPUBLISHED{bazzikonjevod:disc-04erratum,
AUTHOR = {Rida A. Bazzi and Goran Konjevod},
TITLE = {Erratum: Efficient Verification for Provably Secure Storage
and Secret Sharing in Systems Where Half the Servers Are Faulty},
YEAR = {2004},
CATID1 = {distributed.paper},
URL = {disc04-erratum.pdf}
}
@INPROCEEDINGS{srinivasanetal:iccd-04,
AUTHOR = {Krishnan Srinivasan and Karam S. Chatha and Goran Konjevod},
TITLE = {Linear Programming Based Techniques for Synthesis of
Network-on-Chip Architectures},
BOOKTITLE = {Proceedings of the 22nd ICCD},
PAGES = {422--429},
YEAR = {2004},
CATID1 = {cad.paper},
CATID1 = {conference.paper},
URL = {iccd04.pdf}
}
@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}
}
@INPROCEEDINGS{guptaetal:dialm-02,
AUTHOR = {Sandeep K. S. Gupta and Goran Konjevod and Georgios Varsamopoulos},
TITLE = {A theoretical study of optimization techniques used in
registration area based location management: models and online algorithms},
BOOKTITLE = {Proceedings of the 6th DIAL-M},
YEAR = {2002},
PAGES = {72--79},
CATID1 = {conference.paper},
URL = {dialm02.ps.gz},
CATID1 = {other.paper}
}
@INPROCEEDINGS{barrettetal:esa-02,
AUTHOR = {Christopher L. Barrett and Keith Bisset and Riko Jacob
and Goran Konjevod and Madhav V. Marathe},
TITLE = {Classical and Contemporary Shortest Path Problems in Road
Networks: Implementation and Experimental Analysis of the TRANSIMS Router},
BOOKTITLE = {Proceedings of the 10th ESA},
YEAR = {2002},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2461},
PAGES = {126--138},
CATID1 = {conference.paper},
CATID1 = {shpaths.paper},
URL = {transims.pdf}
}
@INPROCEEDINGS{konjevodetal:latin-02,
AUTHOR = {Goran Konjevod and Soohyun Oh and Andr\'{e}a W. Richa},
TITLE = {Finding Most Sustainable Paths in Networks with
Time-Dependent Edge Reliabilities},
BOOKTITLE = {Proceedings of the 5th LATIN},
YEAR = {2002},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2286},
PAGES = {435--450},
CATID1 = {conference.paper},
URL = {oh.ps.gz},
CATID1 = {other.paper}
}
@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{konjevodetal:ipl-01,
AUTHOR = {Goran Konjevod and R. Ravi and F. Sibel Salman},
TITLE = {On approximating planar metrics by tree metrics},
JOURNAL = {Information Processing Letters},
VOLUME = {80},
NUMBER = {4},
PAGES = {213--219},
YEAR = {2001},
CATID1 = {journal.paper},
CATID1 = {metric.paper},
URL = {metrics.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}
}
@INPROCEEDINGS{czabarkaetal:soda-00,
AUTHOR = {\'{E}va Czabarka and Goran Konjevod and Madhav V. Marathe
and Allon G. Percus and David C. Torney},
TITLE = {Algorithms for optimizing production {D}{N}{A} sequencing},
BOOKTITLE = {Proceedings of the 11thAnnual ACM-SIAM Symposium on Discrete Algorithms},
PAGES = {399--408},
CATID1 = {conference.paper},
CATID1 = {compbio.paper},
CATID1 = {other.paper},
YEAR = {2000},
URL = {dna.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.