The following pages link to Refael Hassin (Q233539):
Displaying 50 items.
- An approximation algorithm for maximum packing of 3-edge paths (Q287133) (← links)
- An approximation algorithm for the maximum traveling salesman problem (Q293334) (← links)
- When Markov chains meet: a continuous-time model of network evolution (Q297166) (← links)
- Series-parallel orientations preserving the cycle-radius (Q413267) (← links)
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
- On the minimum diameter spanning tree problem (Q673823) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Optimal sales to users who hold inventory (Q753652) (← links)
- On two restricted ancestors tree problems (Q765480) (← links)
- On local search for weighted \(k\)-set packing (Q826067) (← links)
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
- Erratum to ``An approximation algorithm for maximum triangle packing'' (Q858314) (← links)
- Flow trees for vertex-capacitated networks (Q869579) (← links)
- Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP (Q935238) (← links)
- Rounding to an integral program (Q943791) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- The use of relative priorities in optimizing the performance of a queueing system (Q958090) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
- Equilibrium customers' choice between FCFS and random servers (Q1039621) (← links)
- Stable priority purchasing in queues (Q1082722) (← links)
- Control of arrivals and departures in a state-dependent input-output system (Q1085772) (← links)
- Multi-terminal maximum flows in node-capacitated networks (Q1085773) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- Optimal allocation of quotas (Q1128554) (← links)
- Approximation algorithms for hitting objects with straight lines (Q1173978) (← links)
- Multiterminal xcut problems (Q1179738) (← links)
- Improved complexity bounds for location problems on the real line (Q1180820) (← links)
- Asymptotic analysis of dichotomous search with search and travel costs (Q1197653) (← links)
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
- Approximation algorithms for minimum tree partition (Q1270776) (← links)
- Approximation algorithms for min-sum \(p\)-clustering (Q1281390) (← links)
- Scheduling maintenance services to three machines (Q1290156) (← links)
- (Q1308738) (redirect page) (← links)
- Monotonicity and efficient computation of optimal dichotomous search (Q1308740) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Approximation algorithms for maximum dispersion (Q1375119) (← links)
- The scheduling of maintenance service (Q1383367) (← links)
- Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
- To queue or not to queue: equilibrium behavior in queueing systems. (Q1422253) (← links)
- Minimum restricted diameter spanning trees. (Q1427810) (← links)
- Graph partitions with minimum degree constraints (Q1584392) (← links)
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139) (← links)
- Approximation algorithms for maximum linear arrangement (Q1603380) (← links)
- Better approximations for max TSP (Q1607064) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410) (← links)
