Sciweavers

Share
8 search results - page 1 / 2
» Constant Factor Approximation for Subset Feedback Set Proble...
Sort
View
SODA
2016
ACM
55views Algorithms» more  SODA 2016»
4 years 7 months ago
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation
We consider subset feedback edge and vertex set problems in undirected graphs. The input to these problems is an undirected graph G = (V, E) and a set S = {s1, s2, . . . , sk} ⊂...
Chandra Chekuri, Vivek Madan
APPROX
2015
Springer
36views Algorithms» more  APPROX 2015»
4 years 7 months ago
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking
In the Maximum Weight Independent Set of Rectangles (MWISR) problem, we are given a collection of weighted axis-parallel rectangles in the plane. Our goal is to compute a maximum ...
Anna Adamaszek, Parinya Chalermsook, Andreas Wiese
NIPS
2007
10 years 1 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
FOCS
2006
IEEE
10 years 5 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
10 years 9 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
books