scientific article; zbMATH DE number 7205033

DOI10.4230/LIPIcs.ESA.2017.55zbMath1442.68267MaRDI QIDQ5111744

Gilad Kutiel, Dror Rawitz

Publication date: 27 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

local searchapproximation algorithmssubmodular maximizationstar packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20) Matching models (91B68)

Related Items (1)

Approximate ridesharing of personal vehicles problem

Cites Work

• Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
• Optimization for dynamic ride-sharing: a review
• Scalability issues in optimal assignment for carpooling
• Improved approximation algorithms for the spanning star forest problem
• Approximation algorithms for the maximum carpool matching problem
• Greedy Local Improvement and Weighted Set Packing Approximation
• On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
• An Improved Approximation Bound for Spanning Star Forest and Color Saving
• A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
• Improved Approximation Algorithms for Weighted 2-Path Partitions
• Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
• Deterministic Algorithms for Submodular Maximization Problems

This page was built for publication: