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

Approximation Algorithms for Union and Intersection Covering Problems

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

DOI10.4230/LIPICS.FSTTCS.2011.28zbMath1246.68262OpenAlexW2160296932MaRDI QIDQ2911608

Marcin Pilipczuk, Marcin Mucha, Piotr Sankowski, Fabrizio Grandoni, Marek Cygan, Stefano Leonardi

Publication date: 31 August 2012

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2011.28


zbMATH Keywords

approximation algorithmspartial covering problems


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25)


Related Items (2)

The maximum exposure problem ⋮ The Maximum Exposure Problem.







This page was built for publication: Approximation Algorithms for Union and Intersection Covering Problems

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