Searching for authors named "Goran Konjevod" – sorted by Relevance.
-
Cv
- Goran Konjevod Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213
- Add To MetaCart
-
Communication Network]: Distributed Systems General Terms: Algorithms, Design
- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension Goran Konjevod Arizona
- Add To MetaCart
-
Optimal-stretch name-independent compact routing in doubling metrics
- Optimal-Stretch Name-Independent Compact Routing in Doubling Metrics ABSTRACT Goran Konjevod ∗ CSE
- Cited by 7 (2 self) – Add To MetaCart
-
An Approximation Algorithm for the Covering Steiner Problem
- An Approximation Algorithm for the Covering Steiner Problem Goran Konjevod* R. Ravi I Abstract
- Cited by 16 (4 self) – Add To MetaCart
-
A polylogarithmic approximation algorithm for the group Steiner tree problem
- A polylogarithmic approximation algorithm for the group Steiner tree problem Naveen Garg* Goran
- Cited by 77 (7 self) – Add To MetaCart
-
Improved Approximations for Tour and Tree Covers
- Improved approximations for tour and tree covers Jochen Konemann 1? , Goran Konjevod 2
- Cited by 4 (0 self) – Add To MetaCart
-
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
- Problem Robert Carr 1? , Toshihiro Fujito 2?? , Goran Konjevod 3? ? ? , and Ojas Parekh 3y 1
- Cited by 8 (3 self) – Add To MetaCart
-
A non-ilp based threshold logic synthesis methodology
- Konjevod School of Computing and Informatics, Arizona State University, Tempe AZ {tejaswi, vrudhula, goran
- Cited by 1 (1 self) – Add To MetaCart
-
On Approximating Planar Metrics by Tree Metrics
- On Approximating Planar Metrics by Tree Metrics Goran Konjevod* R. Ravi t F. Sibel Salman
- Cited by 20 (3 self) – Add To MetaCart
-
Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering problems
- t Goran Konjevod ++ R. Ravi Santosh Vempala November 13, 1998 Abstract We present simple semi
- Cited by 23 (3 self) – Add To MetaCart

