The following pages link to Guy Kortsarz (Q260246):
Displaying 50 items.
- (Q172553) (redirect page) (← links)
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- On some network design problems with degree constraints (Q355516) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- On a local protocol for concurrent file transfers (Q487273) (← links)
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- Approximating minimum-power degree and connectivity problems (Q547290) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- The checkpoint problem (Q714790) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- Approximating the minimal sensor selection for supervisory control (Q853685) (← links)
- Power optimization for connectivity problems (Q877193) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- A note on two source location problems (Q1018105) (← links)
- Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- Traffic-light scheduling on the grid (Q1339892) (← links)
- Multicoloring trees. (Q1401922) (← links)
- Approximating node connectivity problems via set covers (Q1424250) (← links)
- Generalized submodular cover problems and applications (Q1589434) (← links)
- A matched approximation bound for the sum of a greedy coloring (Q1606980) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- A bounded-risk mechanism for the kidney exchange game (Q1752443) (← links)
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs (Q1879365) (← links)
- Two-stage robust network design with exponential scenarios (Q1939662) (← links)
- A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) (Q1944093) (← links)
- The minimum degree group Steiner problem (Q2065790) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- Radio aggregation scheduling (Q2202004) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- The minimum shift design problem (Q2468734) (← links)
- Sublogarithmic approximation for telephone multicast (Q2495404) (← links)
- An approximation algorithm for the directed telephone multicast problem (Q2505499) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Network design under general wireless interference (Q2665910) (← links)
- On Approximating the Achromatic Number (Q2753533) (← links)
- (Q2753740) (← links)
- (Q2766683) (← links)
- (Q2768311) (← links)
- A Bounded-Risk Mechanism for the Kidney Exchange Game (Q2802957) (← links)
