The following pages link to Leen Stougie (Q627159):
Displayed 50 items.
- Item:Q627159 (redirect page) (← links)
- A simple randomised algorithm for convex optimisation (Q463726) (← links)
- The distributed wireless gathering problem (Q627160) (← links)
- Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets (Q714835) (← links)
- Erratum to: ``Computational complexity of stochastic programming problems'' (Q747782) (← links)
- Online \(k\)-server routing problems (Q839628) (← links)
- A linear bound on the diameter of the transportation polytope (Q858109) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- A probabilistic analysis of the multiknapsack value function (Q909581) (← links)
- On the relation between complexity and uncertainty (Q920029) (← links)
- Bincoloring (Q954994) (← links)
- An approximation algorithm for the wireless gathering problem (Q957364) (← links)
- Data aggregation in sensor networks: Balancing communication and delay costs (Q1008733) (← links)
- On rates of convergence and asymptotic normality in the multiknapsack problem (Q1181902) (← links)
- Probabilistic analysis of the minimum weighted flowtime scheduling problem (Q1197880) (← links)
- Modelling aspects of distributed processing in telecommunication networks (Q1270602) (← links)
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions (Q1290662) (← links)
- Approximation algorithms and relaxations for a service provision problem on a telecommunication network (Q1399109) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- Approximation algorithms for the test cover problem (Q1424310) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- The Itinerant List Update problem (Q1757780) (← links)
- A class of generalized greedy algorithms for the multi-knapsack problem (Q1803680) (← links)
- A fast randomized algorithm for partitioning a graph into paths of fixed length (Q1803681) (← links)
- A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
- On-line dial-a-ride problems under a restricted information model (Q1884776) (← links)
- On the convex hull of the simple integer recourse objective function (Q1896454) (← links)
- An algorithm for the construction of convex hulls in simple integer recourse programming (Q1918422) (← links)
- Minimizing bed occupancy variance by scheduling patients under uncertainty (Q2184122) (← links)
- Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
- Fixed-order scheduling on parallel machines (Q2293084) (← links)
- Split scheduling with uniform setup times (Q2341391) (← links)
- Location of slaughterhouses under economies of scale (Q2433439) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- On-line multi-threaded scheduling (Q2464386) (← links)
- Stochastic facility location with general long-run costs and convex short-run costs (Q2475855) (← links)
- Computational complexity of stochastic programming problems (Q2492669) (← links)
- Simple integer recourse models: convexity and convex approximations (Q2502210) (← links)
- A linear programming formulation of Mader's edge-disjoint paths problem (Q2581506) (← links)
- Local improvement algorithms for a path packing problem: a performance analysis based on linear programming (Q2661591) (← links)
- A duality based 2-approximation algorithm for maximum agreement forest (Q2687064) (← links)
- (Q2728897) (← links)
- Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems (Q2796402) (← links)
- The Online TSP Against Fair Adversaries (Q2884500) (← links)
- Computer-Aided Complexity Classification of Dial-a-Ride Problems (Q2890414) (← links)
- Universal Sequencing on an Unreliable Machine (Q2910853) (← links)
- Scheduling over Scenarios on Two Machines (Q2920492) (← links)
- Latency-constrained aggregation in sensor networks (Q2930288) (← links)