The following pages link to Nir Halman (Q306251):
Displaying 35 items.
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
- Discrete and lexicographic Helly-type theorems (Q938305) (← links)
- The convex dimension of a graph (Q997061) (← links)
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- On the complexity of energy storage problems (Q1662159) (← links)
- The TV advertisements scheduling problem (Q1733325) (← links)
- Approximating convex functions via non-convex oracles under the relative noise model (Q1751103) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions (Q2032152) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences (Q2128769) (← links)
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems (Q2461633) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle (Q2917636) (← links)
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand (Q3169059) (← links)
- Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks (Q3541789) (← links)
- (Q3579452) (← links)
- On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model (Q3614147) (← links)
- Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← links)
- (Q4636439) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
- Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs (Q5246083) (← links)
- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs (Q5891186) (← links)
- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs (Q5892239) (← links)
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)
- Knapsack problems with position-dependent item weights or profits (Q6165391) (← links)
- Packing squares independently (Q6652453) (← links)
