The following pages link to Zeev Nutov (Q260247):
Displaying 50 items.
- (Q208489) (redirect page) (← links)
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- On some network design problems with degree constraints (Q355516) (← links)
- Survivable network activation problems (Q386909) (← links)
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- Approximating minimum-power degree and connectivity problems (Q547290) (← links)
- Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
- A note on labeling schemes for graph connectivity (Q763487) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- Power optimization for connectivity problems (Q877193) (← links)
- On shredders and vertex connectivity augmentation (Q924546) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743) (← links)
- Covering a laminar family by leaf to leaf links (Q987693) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Wireless network design via 3-decompositions (Q990943) (← links)
- Listing minimal edge-covers of intersecting families with applications to connectivity problems (Q1003760) (← links)
- A note on two source location problems (Q1018105) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- Approximating node connectivity problems via set covers (Q1424250) (← links)
- On integrality, stability and composition of dicycle packings and covers (Q1583704) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs (Q1816947) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope (Q1906776) (← links)
- A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) (Q1944093) (← links)
- Covering users by a connected swarm efficiently (Q2037819) (← links)
- The minimum degree group Steiner problem (Q2065790) (← links)
- Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
