45 results on '"Nutov, Zeev"'
Search Results
2. 2-Node-Connectivity Network Design
3. Approximating activation edge-cover and facility location problems
4. The minimum degree Group Steiner problem
5. A 4 + ϵ approximation for k-connected subgraphs
6. A polylogarithmic approximation algorithm for 2-edge-connected dominating set
7. Improved approximation algorithms for minimum power covering problems
8. Approximating Steiner trees and forests with minimum number of Steiner points
9. Improved approximation algorithms for k-connected m-dominating set problems
10. LP-relaxations for tree augmentation
11. Approximating minimum-power edge-covers and 2,3-connectivity
12. Approximating source location and star survivable network problems
13. Survivable network activation problems
14. Smallℓ-edge-covers ink-connected graphs
15. On some network design problems with degree constraints
16. A(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
17. Approximating subset k-connectivity problems
18. Improved approximation algorithms for maximum lifetime problems in wireless networks
19. Improved approximation algorithms for Directed Steiner Forest
20. Approximating fault-tolerant group-Steiner problems
21. A note on labeling schemes for graph connectivity
22. Approximating some network design problems with node costs
23. Approximating survivable networks with β-metric costs
24. Approximating directed weighted-degree constrained networks
25. A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
26. Covering a laminar family by leaf to leaf links
27. Approximating minimum power covers of intersecting families and directed edge-connectivity problems
28. On minimum power connectivity problems
29. Wireless network design via 3-decompositions
30. A note on Rooted Survivable Networks
31. Inapproximability of survivable networks
32. Listing minimal edge-covers of intersecting families with applications to connectivity problems
33. A note on two source location problems
34. Tight approximation algorithm for connectivity augmentation problems
35. On extremal k-outconnected graphs
36. Approximating maximum satisfiable subsystems of linear equations of bounded width
37. On shredders and vertex connectivity augmentation
38. Packing directed cycles efficiently
39. A (1–)-approximation algorithm for the generalized assignment problem
40. A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
41. A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
42. Faster approximation algorithms for weighted triconnectivity augmentation problems
43. Doubly stochastic matrices and dicycle covers and packings in eulerian digraphs
44. On non-{0, 1/2, 1} extreme points of the generalized transitive tournament polytope
45. On the integral dicycle packings and covers and the linear ordering polytope
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.