| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nili Guttmann-Beck, Refael Hassin |
Series-parallel orientations preserving the cycle-radius.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin |
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin |
Minimum diameter and cycle-diameter orientations on planar graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin |
On two restricted ancestors tree problems. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihai Glazer, Refael Hassin |
Inducing search by periodic advertising. |
Information Economics and Policy |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Jérôme Monnot, Danny Segev |
The Complexity of Bottleneck Labeled Graph Problems. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Goraly, Refael Hassin |
Multi-Color Pebble Motion on Graphs. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Einat Or |
Min sum clustering with penalties. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin |
The (K, k)-Capacitated Spanning Tree Problem. |
AAIM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin |
Equilibrium customers' choice between FCFS and random servers. |
Queueing Syst. |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 60K25, 90B22 |
| 1 | Refael Hassin, Asaf Levin, Shlomi Rubinstein |
Approximation algorithms for maximum latency and partial cycle cover. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Justo Puerto, Francisco R. Fernández |
The use of relative priorities in optimizing the performance of a queueing system. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin, Maxim Sviridenko |
Approximating the minimum quadratic assignment problems. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, R. Ravi, F. Sibel Salman |
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Danny Segev |
Rounding to an integral program. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Ariel Keinan |
Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin |
The k-path tree matroid and its applications to survivable network design. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Sharon Mendel |
Scheduling Arrivals to Queues: A Single-Server Model with No-Shows. |
Management Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Jérôme Monnot, Danny Segev |
Approximation algorithms and hardness results for labeled connectivity problems. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Labeled connectivity, Approximation algorithms, Hardness of approximation |
| 1 | Refael Hassin, Asaf Levin |
Flow trees for vertex-capacitated networks. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Jérôme Monnot, Danny Segev |
The Complexity of Bottleneck Labeled Graph Problems. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Moshe Haviv |
Who should be given priority in a queue? |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvia Agur, Refael Hassin, Sigal Levy |
Optimizing Chemotherapy Scheduling Using Local Search Heuristics. |
Operations Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
The minimum generalized vertex cover problem. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
complexity classification, Vertex cover, local-ratio |
| 1 | Refael Hassin, Danny Segev |
Robust subgraphs for trees and paths. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, decomposition, spanning trees, robust optimization |
| 1 | Esther M. Arkin, Refael Hassin, Asaf Levin |
Approximations for minimum and min-max vehicle routing problems. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
An approximation algorithm for maximum triangle packing. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979]. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Jérôme Monnot, Danny Segev |
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Einat Or |
A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification. |
WEA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
On the complexity of the k-customer vehicle routing problem. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Jérôme Monnot |
The maximum saving partition problem. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ari Veltman, Refael Hassin |
Equilibrium in Queueing Systems with Complementary Products. |
Queueing Syst. |
2005 |
DBLP DOI BibTeX RDF |
complementary products, game theory, queueing theory, Nash equilibrium |
| 1 | Ori Einstein, Refael Hassin |
The Number of Solutions Sufficient for Solving a Family of Problems. |
Math. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Mati Shani |
Machine scheduling with earliness, tardiness and non-execution penalties. |
Computers & OR |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Refael Hassin, Jérôme Monnot |
Approximation algorithms for some vehicle routing problems. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
An Approximation Algorithm for the Minimum Latency Set Cover Problem. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
Minimum sum set cover, minimum latency, approximation algorithm |
| 1 | Refael Hassin, Einat Or |
Min Sum Clustering with Penalties. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Danny Segev |
Rounding to an Integral Program. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Danny Segev |
The Multi-radius Cover Problem. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Danny Segev |
The Set Cover with Pairs Problem. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Approximation Algorithms for Quickest Spanning Tree Problems. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Quickest path problem, Minimum diameter spanning tree problem, Approximation algorithms |
| 1 | Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko |
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Approximation algorithm, NP-complete problem, Transportation problem |
| 1 | Refael Hassin, Asaf Levin |
Synthesis of 2-Commodity Flow Networks. |
Math. Oper. Res. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Minimum restricted diameter spanning trees. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Approximation Algorithms for Quickest Spanning Tree Problems. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
An Approximation Algorithm for Maximum Triangle Packing. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
maximum triangle packing, 2-edge paths, Analysis of algorithms |
| 1 | Refael Hassin, Danny Segev |
Robust Subgraphs for Trees and Paths. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
Approximation algorithms for the metric maximum clustering problem with given cluster sizes. |
Oper. Res. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Conforti, Refael Hassin, R. Ravi |
Reconstructing edge-disjoint paths. |
Oper. Res. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, R. Ravi, F. Sibel Salman |
Approximation Algorithms for a Capacitated Network Design Problem. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Routing flow, Capacity installation, Approximation algorithms, Network design |
| 1 | Refael Hassin, Asaf Levin, Dana Morad |
Lexicographic local search and the p. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Minimum spanning tree with hop restrictions. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or |
Capacitated vertex covering. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Subgraphs decomposable into two trees and k-edge-connected subgraphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
The Minimum Generalized Vertex Cover Problem. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Refael Hassin, Jérôme Monnot |
Differential Approximation for Some Routing Problems. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
differential ratio, approximation algorithm, TSP, VRP |
| 1 | Refael Hassin, Shlomi Rubinstein |
A 7/8-approximation algorithm for metric Max TSP. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Approximation algorithms for constructing wavelength routing networks. |
Networks |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Moshe Haviv |
Nash Equilibrium and Subgame Perfection in Observable Queues. |
Annals OR |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
Robust Matchings. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin, Shimon Shahar |
Increasing digraph arc-connectivity by arc addition, reversal and complement. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin |
A note on orientations of mixed graphs. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Refael Hassin, Kazuo Iwama |
Complexity of finding dense subgraphs. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or |
Capacitated vertex covering with applications. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko |
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Minimum Restricted Diameter Spanning Trees. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
Approximation algorithms for maximum linear arrangement. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin, Maxim Sviridenko |
Approximating the maximum quadratic assignment problem. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Samir Khuller |
z-Approximations. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Ageev, Refael Hassin, Maxim Sviridenko |
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. |
SIAM J. Discrete Math. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
A 7/8-Approximation Algorithm for Metric Max TSP. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Synthesis of 2-Commodity Flow Networks. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
Better approximations for max TSP. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin |
Minimum-diameter covering problems. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari |
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin |
Approximation Algorithms for Minimum K-Cut. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Minimum cuts |
| 1 | Esther M. Arkin, Refael Hassin |
Approximating the maximum quadratic assignment problem. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
Approximation Algorithms for Maximum Linear Arrangement. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
Robust Matchings and Maximum Clustering. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Ageev, Refael Hassin, Maxim Sviridenko |
An approximation algorithm for MAX DICUT with given sizes of parts. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, R. Ravi, F. Sibel Salman |
Approximation algorithms for a capacitated network design problem. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
An Approximation Algorithm for the Maximum Traveling Salesman Problem. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin |
Graph partitions with minimum degree constraints. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin |
Approximation Algorithms for Minimum Tree Partition. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Shoshana Anily, Celia A. Glass, Refael Hassin |
The Scheduling of Maintenance Service. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin |
Approximation Algorithms for Min-sum p-clustering. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari |
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein, Arie Tamir |
Approximation algorithms for maximum dispersion. |
Oper. Res. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
An Approximation Algorithm for Maximum Packing of 3-Edge Paths. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin, Limor Klein |
Restricted delivery problems on a network. |
Networks |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin |
Approximation Algorithms for Min-Max Tree Partition. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin |
On Local Search for Weighted k-Set Packing. |
ESA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Arie Tamir |
On the Minimum Diameter Spanning Tree Problem. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Benelli, Refael Hassin |
optimal Separable Partitioning in the Plane. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomo Lahav |
Maximizing the Number of Unused Colors in the Vertex Coloring Problem. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein |
Approximations for the Maximum Acyclic Subgraph Problem. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")