“Whoa! It’s like Spotify but for academic articles.”

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

Try 2 weeks free now

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.

DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy unlimited access and
personalized recommendations from
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $40/month

Try 2 weeks free now

Explore the DeepDyve Library

How DeepDyve Works

Spend time researching, not time worrying you’re buying articles that might not be useful.

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

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.

See the journals in your area

Simple and Affordable Pricing

14-day free trial. Cancel anytime, with a 30-day money-back guarantee.

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches


Best Deal — 25% off

Annual Plan

  • All the features of the Professional Plan, but for 25% off!
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

billed annually