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