36 results on '"Nutov, Zeev"'
Search Results
2. Approximating activation edge-cover and facility location problems
3. The minimum degree Group Steiner problem
4. A [formula omitted]-approximation algorithm for minimum power k edge disjoint st-paths
5. Improved approximation algorithms for minimum power covering problems
6. LP-relaxations for tree augmentation
7. Approximating source location and star survivable network problems
8. Survivable network activation problems
9. Small [formula omitted]-edge-covers in [formula omitted]-connected graphs
10. A [formula omitted]-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
11. Approximating subset k-connectivity problems
12. Improved approximation algorithms for maximum lifetime problems in wireless networks
13. Approximating fault-tolerant group-Steiner problems
14. A polylogarithmic approximation algorithm for 2-edge-connected dominating set
15. Approximating survivable networks with β-metric costs
16. Approximating some network design problems with node costs
17. Approximating directed weighted-degree constrained networks
18. On minimum power connectivity problems
19. Approximating minimum power covers of intersecting families and directed edge-connectivity problems
20. Covering a laminar family by leaf to leaf links
21. Inapproximability of survivable networks
22. Approximating minimum-power edge-covers and [formula omitted]-connectivity
23. Listing minimal edge-covers of intersecting families with applications to connectivity problems
24. A note on two source location problems
25. On extremal k-outconnected graphs
26. On shredders and vertex connectivity augmentation
27. Packing directed cycles efficiently
28. Improved approximation algorithms for k-connected m-dominating set problems
29. A note on labeling schemes for graph connectivity
30. A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
31. Wireless network design via 3-decompositions
32. A note on Rooted Survivable Networks
33. Approximating maximum satisfiable subsystems of linear equations of bounded width
34. A (1– [formula omitted])-approximation algorithm for the generalized assignment problem
35. Faster approximation algorithms for weighted triconnectivity augmentation problems
36. 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.