Ashkan Aazami

Available identifiers

zbMath Open aazami.ashkanMaRDI QIDQ987495

List of research outcomes

Publication	Date of Publication	Type
A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs	2013-03-13	Paper
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs	2012-04-26	Paper
Approximation Algorithms and Hardness for Domination with Propagation	2010-08-27	Paper
Domination in graphs with bounded propagation: Algorithms, formulations and hardness results	2010-08-13	Paper
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs	2009-10-28	Paper
Approximation Algorithms and Hardness for Domination with Propagation	2009-02-17	Paper

Research outcomes over time

This page was built for person: Ashkan Aazami