Katriel Irit

Irit Katriel

Information about the author Irit Katriel will soon be added to the site.
Found 4 papers in total
An O(n log n) version of the Averbakh-Berman algorithm for the robust median of a tree
An O(n log n) version of the Averbakh-Berman algorithm for the robust median of a tree
2008
We show that the minmax regret median of a tree can be found in O( n log n ) time....
Undirected forest constraints
Undirected forest constraints
2009
We present two constraints that partition the vertices of an undirected n -vertex, m...
Matchings in Node-Weighted Convex Bipartite Graphs
Matchings in Node-Weighted Convex Bipartite Graphs
2008
Matchings in convex bipartite graphs correspond to the problem of scheduling...
An O(nlogn) version of the Averbakh–Berman algorithm for the robust median of a tree
An O(nlogn) version of the Averbakh–Berman algorithm for the robust median of a tree
2008
We show that the minmax regret median of a tree can be found in O( n log n ) time....
Papers per page: