search result

Cover von Front Matter, Table of Contents, Preface, Conference Organization

Front Matter, Table of Contents, Preface, Conference Organization

Year: 2025
Media group: LIPIcs
Cover von LIPIcs, Volume 353, APPROX/RANDOM 2025, Complete Volume

LIPIcs, Volume 353, APPROX/RANDOM 2025, Complete Volume

Year: 2025
Media group: LIPIcs
Cover von Solving Linear Programs with Differential Privacy

Solving Linear Programs with Differential Privacy

Year: 2025
Media group: LIPIcs
Cover von Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint

Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint

Year: 2019
Media group: LIPIcs
Cover von A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

Year: 2019
Media group: LIPIcs
Cover von Approximation, Randomization, and Combinatorial Optimization
Algorithms and Techniques : APPROX/RANDOM 2025, August 11-13, 2025, Berkeley, CA, USA
Search for this author
Year: 2025
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 353
Media group: LIPIcs
Cover von Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture

Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture

Year: 2014
Media group: LIPIcs
Cover von Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints

Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints

Year: 2020
Media group: LIPIcs
Cover von Approximation Algorithms for Stochastic k-TSP

Approximation Algorithms for Stochastic k-TSP

Year: 2018
Media group: LIPIcs
Cover von Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs

Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs

Year: 2016
Media group: LIPIcs
OPEN V 11.1.0.0