Searching for authors named "Asaf Levin" – sorted by Relevance.
-
Approximating the unweighted k-set cover problem: greedy meets local search
- ���Approximating the unweighted k-set cover problem: greedy meets local search Asaf Levin 1
- Cited by 1 (0 self) – Add To MetaCart
-
Minimum Restricted Diameter Spanning Trees
- Minimum restricted diameter spanning trees Refael Hassin and Asaf Levin 1 April 28, 2003 Abstract
- Cited by 3 (0 self) – Add To MetaCart
-
Better bounds for minimizing sonet adms
- ���Better bounds for minimizing SONET ADMs Leah Epstein ��� Asaf Levin ��� Abstract SONET add
- Cited by 8 (1 self) – Add To MetaCart
-
The minimum generalized vertex cover problem
- ���The minimum generalized vertex cover problem 1 Refael Hassin 2 and Asaf Levin 3 June 21, 2005
- Cited by 2 (1 self) – Add To MetaCart
-
Synthesis of 2-commodity flow networks
- ���Synthesis of 2-commodity flow networks Refael Hassin and Asaf Levin July 27, 2005 Abstract We
- Cited by 2 (0 self) – Add To MetaCart
-
An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Using Matroid Intersection
- using matroid intersection Refael Hassin and Asaf Levin 1 September 25, 2003 Abstract Given
- Cited by 5 (0 self) – Add To MetaCart
-
Partial multicuts in trees
- ���Partial Multicuts in Trees ��� Asaf Levin 1 and Danny Segev 2 1 Department of Statistics, The Hebrew
- Cited by 6 (3 self) – Add To MetaCart
-
Minimum Spanning Tree with Hop Restrictions
- Minimum spanning tree with hop restrictions Refael Hassin and Asaf Levin 1 Department
- Cited by 2 (1 self) – Add To MetaCart
-
On bin packing with conflicts
- ���On bin packing with conflicts Leah Epstein 1 and Asaf Levin 2 1 Department of Mathematics
- Cited by 5 (2 self) – Add To MetaCart
-
A better-than-greedy approximation algorithm for the minimum set cover problem
- and Asaf Levin 2 February 3, 2005 Abstract In the weighted set-cover problem we are given a set of elements
- Cited by 3 (1 self) – Add To MetaCart

