dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Goran Konjevod (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh: Compacting cuts: A new linear formulation for minimum cut. ACM Transactions on Algorithms 5(3): (2009)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh: Compacting cuts: a new linear formulation for minimum cut. SODA 2007: 43-52
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert D. Carr, Harvey J. Greenberg, William E. Hart, Goran Konjevod, Erik Lauer, Henry Lin, Tod Morrison, Cynthia A. Phillips: Robust optimization of contaminant sensor placement for community water systems. Math. Program. 107(1-2): 337-356 (2006)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh: A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. J. Comb. Optim. 5(3): 317-326 (2001)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh: A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. ESA 2000: 132-142
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe: On the red-blue set cover problem. SODA 2000: 345-353

Selection of 6 from 50 records - Goran Konjevod has 62 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page