The following pages link to Reuven Bar Yehuda (Q1130167):
Displaying 50 items.
- (Q203396) (redirect page) (← links)
- (Q494420) (redirect page) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Local ratio with negative weights. (Q703278) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection (Q803112) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Exploiting locality: Approximating sorting buffers (Q925070) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- Partitioning a sequence into few monotone subsequences (Q1130169) (← links)
- Complexity of finding k-path-free dominating sets in graphs (Q1167535) (← links)
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization (Q1198663) (← links)
- Connections between two cycles --- a new design of dense processor interconnection networks (Q1199411) (← links)
- Rotating-table games and derivatives of words (Q1208719) (← links)
- 1.5-approximation algorithm for the 2-convex recoloring problem (Q1647830) (← links)
- Approximating the dense set-cover problem (Q1765297) (← links)
- A note on multicovering with disks (Q1931286) (← links)
- One for the price of two: a unified approach for approximating covering problems (Q1977131) (← links)
- Using Homogeneous Weights for Approximating the Partial Cover Problem (Q2729647) (← links)
- Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems (Q2755062) (← links)
- Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property (Q2777604) (← links)
- 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem (Q2798241) (← links)
- An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications (Q3084226) (← links)
- (Q3128894) (← links)
- Multiple Communication in Multihop Radio Networks (Q3137713) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs (Q3167030) (← links)
- (Q3374247) (← links)
- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications (Q3558909) (← links)
- Minimum Vertex Cover in Rectangle Graphs (Q3586467) (← links)
- (Q3753476) (← links)
- Fault tolerant distributed majority commitment (Q3813293) (← links)
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference (Q4210077) (← links)
- (Q4252274) (← links)
- Privacy, additional information and communication (Q4307471) (← links)
- TRIANGULATING DISJOINT JORDAN CHAINS (Q4327391) (← links)
- (Q4400844) (← links)
- (Q4488089) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks (Q4578010) (← links)
- A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds (Q4640294) (← links)
- On approximating a geometric prize-collecting traveling salesman problem with time windows (Q4675490) (← links)
- (Q4780780) (← links)
- (Q4829009) (← links)
- A LINEAR-TIME ALGORITHM FOR COVERING SIMPLE POLYGONS WITH SIMILAR RECTANGLES (Q4880212) (← links)
- (Q4938772) (← links)
- A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping (Q5301384) (← links)
- A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds (Q5361909) (← links)
- Distributed Approximation of Maximum Independent Set and Maximum Matching (Q5368958) (← links)
