The following pages link to Daniel Freund (Q1630772):
Displaying 13 items.
- Rank aggregation: new bounds for MCx (Q1630773) (← links)
- Contagious sets in dense graphs (Q1678088) (← links)
- Minimizing multimodular functions and allocating capacity in bike-sharing systems (Q2401156) (← links)
- Physical Zero-Knowledge Proofs of Physical Properties (Q2874544) (← links)
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems (Q5058035) (← links)
- Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework (Q5095174) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- Data-Driven Rebalancing Methods for Bike-Share Systems (Q5154459) (← links)
- Secure Physical Computation Using Disposable Circuits (Q5261629) (← links)
- Overbooking with Bounded Loss (Q6121630) (← links)
- Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems” (Q6122585) (← links)
- Efficient decentralized multi-agent learning in asymmetric bipartite queueing systems (Q6580510) (← links)