{"60483":{"#nid":"60483","#data":{"type":"event","title":"Algorithms \u0026 Randomness Center Colloquium with Howard Karloff","body":[{"value":"\u003Cp\u003EThe Algorithms \u0026amp; Randomness Center (ARC) in the College of Computing welcomes Howard Karloff of AT\u0026amp;T Research for a colloquium on \u0022Disjoint-Path Facility Location: Theory and Practice.\u0022\u003C\/p\u003E\n\n\u003Cp\u003E\u003Cstrong\u003EAbstract:\u003Cbr \/\u003E\u003C\/strong\u003EInternet service providers hope to provide their customers with superior Internet connectivity, but do they always do so? How can an ISP even know what quality of service it\u0027s providing to its customers? To this end, researchers recently proposed a new scheme an ISP could use in order to estimate the packet loss rates experienced by its customers.\u003C\/p\u003E\u003Cp\u003ETo implement the new scheme, one has to approximately solve an interesting NP-Hard optimization problem on the ISP\u0027s network. Specifically, one must choose a small set of network nodes such that from each customer node there are arc-disjoint paths to *two* of the selected nodes. I will discuss recent work, mostly at ATT, attacking this problem and its surprisingly good results, in light of the problem\u0027s provable inapproximability in the worst case.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EThe Algorithms \u0026amp; Randomness Center (ARC) in the College of Computing welcomes Howard Karloff of AT\u0026amp;T Research for a colloquium on \u0022Disjoint-Path Facility Location: Theory and Practice.\u0022\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"\u0022Disjoint-Path Facility Location: Theory and Practice\u0022"}],"uid":"27174","created_gmt":"2010-08-17 15:36:13","changed_gmt":"2016-10-08 01:52:07","author":"Mike Terrazas","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2010-08-18T16:00:00-04:00","event_time_end":"2010-08-18T17:00:00-04:00","event_time_end_last":"2010-08-18T17:00:00-04:00","gmt_time_start":"2010-08-18 20:00:00","gmt_time_end":"2010-08-18 21:00:00","gmt_time_end_last":"2010-08-18 21:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"related_links":[{"url":"http:\/\/www.arc.gatech.edu\/","title":"Algorithms \u0026 Randomness Center (ARC)"}],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"}],"categories":[],"keywords":[{"id":"4265","name":"ARC"},{"id":"208","name":"computing"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EFor more information, contact \u003Ca href=\u0022mailto:ndongi@cc.gatech.edu\u0022\u003EElizabeth Ndongi\u003C\/a\u003E.\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}