46 results on '"Nutov, Zeev"'
Search Results
2. Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families
3. Improved Approximations for Relative Survivable Network Design
4. An -Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths
5. 2-Node-Connectivity Network Design
6. Approximation Algorithms for Connectivity Augmentation Problems
7. On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs
8. Covering Users by a Connected Swarm Efficiently
9. Bounded Degree Group Steiner Tree Problems
10. Improved Approximation Algorithms for Minimum Power Covering Problems
11. Approximating Source Location and Star Survivable Network Problems
12. Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
13. Approximating Steiner Trees and Forests with Minimum Number of Steiner Points
14. On Fixed Cost k-Flow Problems
15. Steiner Forest Orientation Problems
16. Approximating Minimum Power Edge-Multi-Covers
17. Scheduling of Vehicles in Transportation Networks
18. Degree-Constrained Node-Connectivity
19. Survivable Network Activation Problems
20. Approximating Subset k-Connectivity Problems
21. Network-Design with Degree Constraints
22. A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius
23. Approximating Survivable Networks with Minimum Number of Steiner Points
24. Prize-Collecting Steiner Network Problems
25. Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
26. Approximating Node-Connectivity Augmentation Problems
27. Approximating Some Network Design Problems with Node Costs
28. Approximating Directed Weighted-Degree Constrained Networks
29. Approximating Maximum Subgraphs without Short Cycles
30. Inapproximability of Survivable Networks
31. Approximating Minimum-Power k-Connectivity
32. Novel Algorithms for the Network Lifetime Problem in Wireless Settings
33. Approximating Minimum-Power Degree and Connectivity Problems
34. Approximating Steiner Networks with Node Weights
35. Approximating Interval Scheduling Problems with Bounded Profits
36. On Minimum Power Connectivity Problems
37. Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
38. Tight Approximation Algorithm for Connectivity Augmentation Problems
39. Power Optimization for Connectivity Problems
40. Approximation Algorithm for Directed Multicuts
41. Packing Directed Cycles Efficiently
42. Approximating Rooted Connectivity Augmentation Problems
43. A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set : Extended Abstract
44. Approximating Node Connectivity Problems via Set Covers
45. Approximating k-outconnected subgraph problems
46. Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.