“Woah! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $30/month

Get 2 Weeks Free

Open problems: 16

Open problems: 16 Open Problems: 16 Samir Khuller Department of Computer Science University of Maryland, College Park, MD 20742 samir@cs, umd. edu Copyright @ Samir Khuller, 1997 For this column, I include two problems that came to my attention recently, together with a list of problems posted by David Williamson (IBM Research) at the Dagstuhl workshop on Approximation Algorithms in August 1997. I have added references and remarks to his list of problems (which has been shortened slightly). All contributors: please provide short descriptions of the problems, with references. Problems: 1. M i n C o s t N e t w o r k C o n s t r u c t i o n Given a graph G = (V, E) with pairs of vertices (s~, ~i) that have demand di. For each edge e, we have an installation cost of w(e) (weight of the edge) and capacity C. Find a minimum weight set of edges to install, so that we can route the entire demand di for each demand pair. The problem is NP-hard. Is there a constant factor approximation? Using Bartal's result [2] on approximating metric spaces by tree metrics, Awerbuch and Azar [1] have shown http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGACT News Association for Computing Machinery

Loading next page...

You're reading a free preview. Subscribe to read the entire article.

And millions more from thousands of peer-reviewed journals, for just $30/month

Get 2 Weeks Free

To be the best researcher, you need access to the best research

  • With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
  • Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.
  • All the latest content is available, no embargo periods.

Stop missing out on the latest updates in your field

  • We’ll send you automatic email updates on the keywords and journals you tell us are most important to you.
  • There is a lot of content out there, so we help you sift through it and stay organized.