Ehab Morsy

Available identifiers

zbMath Open morsy.ehabMaRDI QIDQ410723

List of research outcomes

Publication	Date of Publication	Type
Approximating the \(k\)-splittable capacitated network design problem	2018-05-24	Paper
Efficient computation of sparse structures	2016-09-15	Paper
An extension of Hall's theorem for partitioned bipartite graphs	2016-07-27	Paper
Approximation algorithms for inventory constrained scheduling on a single machine	2016-01-22	Paper
Approximating the k-Splittable Capacitated Network Design Problem	2014-11-04	Paper
Minmax tree cover in the Euclidean space	2013-11-28	Paper
Efficient Computation of Balanced Structures	2013-08-07	Paper
A plane graph representation of triconnected graphs	2012-04-03	Paper
Approximating capacitated tree-routings in networks	2011-03-17	Paper
On the approximation of the generalized capacitated tree-routing problem	2010-08-18	Paper
Minmax Tree Cover in the Euclidean Space	2009-02-24	Paper
https://portal.mardi4nfdi.de/entity/Q3511979	2008-07-11	Paper
Approximating the Generalized Capacitated Tree-Routing Problem	2008-07-10	Paper
https://portal.mardi4nfdi.de/entity/Q3504906	2008-06-18	Paper
Approximation to the Minimum Cost Edge Installation Problem	2008-05-27	Paper
An improved approximation algorithm for capacitated multicast routings in networks	2008-03-05	Paper
Approximating Capacitated Tree-Routings in Networks	2007-11-13	Paper

Research outcomes over time

This page was built for person: Ehab Morsy