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
End of preview. The entire article is 3 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/open-problems-16-23ENoU7UhK
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Open problems: 16
Khuller, Samir
Follow ACM SIGACT News
, Volume 29 (1)
Association for Computing Machinery – Mar 1, 1998
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
