#### Filter Results:

- Full text PDF available (50)

#### Publication Year

1966

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Madhav V. Marathe, H. Breu, Harry B. Hunt, S. S. Ravi, Daniel J. Rosenkrantz
- Networks
- 1995

Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line… (More)

- Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis
- SIAM J. Comput.
- 1977

Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by the ratio of the obtained tour length to the minimal tour length. For the nearest neighbor method, we show the ratio is bounded above by a logarithmic function of the number of nodes.… (More)

- S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi
- Operations Research
- 1994

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.. INFORMS is… (More)

- Harry B. Hunt, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
- J. Algorithms
- 1998

We present NC approximation schemes for a number of graph problems when restricted to geometric graphs including unit disk graphs and graphs drawn in a civilized manner. Our approximation schemes exhibit the same time versus performance trade-off as the best known approximation schemes for planar graphs. We also define the concept of -precision unit disk… (More)

- R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
- SIAM J. Discrete Math.
- 1994

We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number k of nodes are required to be connected in the solution. A prototypical example is the kMST problem in which we require a tree of minimum weight spanning at least k nodes in an edge-weighted graph. We show… (More)

We study several bicriteria network design problems phrased as follows: given an undirected graph and two minimization objectives with a budget specified on one objective, find a subgraph satisfying certain connectivity requirements that minimizes the second objective subject to the budget on the first. First, we develop a formalism for bicriteria problems… (More)

- Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis
- ACM Trans. Database Syst.
- 1978

A distributed database system is one in which the database is spread among several sites and application programs “move” from site to site to access and update the data they need. The concurrency control is that portion of the system that responds to the read and write requests of the application programs. Its job is to maintain the global… (More)

- Daniel J. Rosenkrantz, Harry B. Hunt
- VLDB
- 1980

- Daniel J. Rosenkrantz
- J. ACM
- 1969

- S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi
- WADS
- 1991