#### Filter Results:

- Full text PDF available (55)

#### Publication Year

1998

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Naveen Garg, Goran Konjevod, R. Ravi
- SODA
- 1998

The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of vertices in a weighted graph, and the goal is to nd a minimum-weight connected subgraph containing at least one vertex from each group. The problem was introduced by Reich and Widmayer and nds applications in VLSI design. The group… (More)

- Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
- IEEE International Conference on Computer Design…
- 2004

Network-on-chip (NoC) has been proposed as a solution for the communication challenges of system-on-chip (SoC) design in the nanoscale regime. SoC design offers the opportunity for incorporating custom NoC architectures that are more suitable for a particular application, and do not necessarily conform to regular topologies. This paper presents novel linear… (More)

Given a nite set of \red" elements R, a nite set of \blue" elements B and a family S 2 RB , the red-blue set cover problem is to nd a subfamily C S which covers all blue elements, but which covers the minimum possible number of red elements. We note that Red-Blue Set Cover is closely related to several combinatorial optimization problems studied earlier.… (More)

- Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
- ICCAD
- 2005

Network-on-chip (NoC) has been proposed as a solution to the communication challenges of system-on-chip (SoC) design in nanoscale technologies. Application specific SoC design offers the opportunity for incorporating custom NoC architectures that are more suitable for a particular application, and do not necessarily conform to regular topologies. Custom NoC… (More)

We have created a large diverse set of cars from overhead images 1 , which are useful for training a deep learner to binary classify, detect and count them. The dataset and all related material will be made publically available. The set contains contextual matter to aid in identification of difficult targets. We demonstrate classification and detection on… (More)

- Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala
- Theor. Comput. Sci.
- 1998

We present simple semi-definite programming relaxations for the NP-hard minimum bandwidth and minimum length linear ordering problems. We then show how these relaxations can be rounded in a natural way (via random projection) to obtain new approximation guarantees for both of these vertex-ordering problems.

We describe and analyze empirically an implementation of some generalizations of Dijkstra's algorithm for shortest paths in graphs. The implementation formed a part of the TRANSIMS project at the Los Alamos National Laboratory. Besides offering the first implementation of the shortest path algorithm with regular language constraints, our code also solves… (More)

- Goran Konjevod, R. Ravi, Aravind Srinivasan
- Random Struct. Algorithms
- 2002

- Rida A. Bazzi, Goran Konjevod
- Distributed Computing
- 2005

We study ways to restrict or prevent the damage that can be caused in a peer-to-peer network by corrupt entities creating multiple pseudonyms. We show that it is possible to <i>remotely</i> issue certificates that can be used to test the distinctness of identities. To our knowledge, this is the first work that shows that remote anonymous certification of… (More)

- Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
- Algorithmica
- 2000

A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph. Arkin et al. give approximation algorithms with ratios 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with a worst-case ratio of 3 for both problems.