Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2904797
Jump to:navigation, search

DOI10.4230/LIPIcs.STACS.2012.601zbMath1245.68249MaRDI QIDQ2904797

Justin Ward, Yuval Filmus

Publication date: 23 August 2012


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

zbMATH Keywords

local searchmatroidsapproximation algorithmsmaximum coverage


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)


Related Items (9)

Siting renewable power generation assets with combinatorial optimisation ⋮ An accelerated continuous greedy algorithm for maximizing strong submodular functions ⋮ Matroid-constrained vertex cover ⋮ Inequalities on submodular functions via term rewriting ⋮ Representative families for matroid intersections, with applications to location, packing, and covering problems ⋮ A constructive proof of swap local search worst-case instances for the maximum coverage problem ⋮ Unnamed Item ⋮ Stability and Recovery for Independence Systems ⋮ An adaptive algorithm for maximization of non-submodular function with a matroid constraint




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2904797&oldid=15871170"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki