The following pages link to Moran Feldman (Q414882):
Displaying 47 items.
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Revenue and reserve prices in a probabilistic single item auction (Q513288) (← links)
- Removal and threshold pricing: truthful two-sided markets with multi-dimensional participants (Q1617660) (← links)
- Correction to: ``Guess free maximization of submodular and linear sums'' (Q2088596) (← links)
- Non-preemptive buffer management for latency sensitive packets (Q2400042) (← links)
- Practical budgeted submodular maximization (Q2701388) (← links)
- Competition in the Presence of Social Networks: How Many Service Providers Maximize Welfare? (Q2937756) (← links)
- Constrained Monotone Function Maximization and the Supermodular Degree (Q2969616) (← links)
- Mechanism Design with Strategic Mediators (Q2989044) (← links)
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Improved Approximations for k-Exchange Systems (Q3092280) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Maximizing Symmetric Submodular Functions (Q3452815) (← links)
- Deterministic Algorithms for Submodular Maximization Problems (Q4554360) (← links)
- Deterministic Algorithms for Submodular Maximization Problems (Q4575606) (← links)
- Online Contention Resolution Schemes (Q4575652) (← links)
- <i>O</i>(depth)-Competitive Algorithm for Online Multi-level Aggregation (Q4575823) (← links)
- Building a Good Team: Secretary Problems and the Supermodular Degree (Q4575852) (← links)
- (Q4606312) (← links)
- (Q4607930) (← links)
- (Q4633905) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns (Q4910801) (← links)
- All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns (Q4962615) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Algorithms for Big Data (Q5112567) (← links)
- The one-way communication complexity of submodular maximization with applications to streaming and robustness (Q5145019) (← links)
- Unconstrained submodular maximization with constant adaptive complexity (Q5212751) (← links)
- A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558) (← links)
- Deterministic (½ + <i>ε</i>)-Approximation for Submodular Maximization over a Matroid (Q5236197) (← links)
- Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization (Q5363100) (← links)
- A Simple <tt><i>O</i>(log log(rank))</tt>-Competitive Algorithm for the Matroid Secretary Problem (Q5363101) (← links)
- Online Submodular Maximization with Preemption (Q5363102) (← links)
- Submodular Maximization with Cardinality Constraints (Q5384068) (← links)
- A Unified Continuous Greedy Algorithm for Submodular Maximization (Q5495032) (← links)
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Guess free maximization of submodular and linear sums (Q5919316) (← links)
- Guess free maximization of submodular and linear sums (Q5925508) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid (Q6170425) (← links)
- Streaming submodular maximization under matroid constraints (Q6560853) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6591883) (← links)
