Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Nutov, Zeev - Department of Mathematics and Computer Science, Open University of Israel
On (t; k)-shredders in k-connected graphs Department of Computer Science
Approximating rooted connectivity augmentation Dept. of Computer Science
Greedy approximation algorithms for directed multicuts Yana Kortsarts
Approximating k-node connected subgraphs via critical Guy Kortsarz
Locating sources to meet connectivity requirenments Guy Kortsarz
Approximation Algorithms for Cycle Packing Problems Michael Krivelevich y Zeev Nutov z Raphael Yuster x
Approximating node connectivity problems via set covers \Lambda
On extremal koutconnected graphs The Open University of Israel
A (1 1=e)-approximation algorithm for the maximum pro t generalized assignment problem with xed pro ts
On Rooted Node-Connectivity Problems Joseph Cheriyan Tibor Jord an y Zeev Nutov z
A 3=2-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
On shredders and vertex connectivity augmentation Gilad Liberman
Approximating connectivity augmentation problems Zeev Nutov
Packing Directed Cycles Eciently Raphael Yuster y Zeev Nutov z
