The following pages link to Iftah Gamzu (Q261340):
Displaying 26 items.
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
- Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
- Buffer management for colored packets with deadlines (Q693758) (← links)
- Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- The loss of serving in the dark (Q2680226) (← links)
- Efficient Submodular Function Maximization under Linear Packing Constraints (Q2843232) (← links)
- On the Approximability of Reachability-Preserving Network Orientations (Q2909122) (← links)
- Improved Approximation for Orienting Mixed Graphs (Q2913215) (← links)
- Improved online algorithms for the sorting buffer problem on line metrics (Q2930290) (← links)
- Truthful unsplittable flow for large capacity networks (Q2930315) (← links)
- The Asymmetric Matrix Partition Problem (Q2937740) (← links)
- Generalized Reordering Buffer Management (Q2965475) (← links)
- Submodular Max-SAT (Q3092241) (← links)
- Truthful Unification Framework for Packing Integer Programs with Choices (Q3521969) (← links)
- A Sublogarithmic Approximation for Highway and Tollbooth Pricing (Q3587409) (← links)
- Improved Online Algorithms for the Sorting Buffer Problem (Q3590972) (← links)
- Truthful Mechanisms via Greedy Iterative Packing (Q3638869) (← links)
- Approximation algorithms for sequential batch‐testing of series systems (Q4632927) (← links)
- Improved Orientations of Physical Networks (Q4932595) (← links)
- Multiple intents re-ranking (Q5172763) (← links)
- (Q5365100) (← links)
- Improved Lower Bounds for Non-utilitarian Truthfulness (Q5443369) (← links)
- The loss of serving in the dark (Q5495867) (← links)
- A Sublogarithmic Approximation for Tollbooth Pricing on Trees (Q5739145) (← links)
