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
Discussion
View source
View history
Purge
English
Log in

Approximation Algorithms for Union and Intersection Covering Problems

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

DOI10.4230/LIPICS.FSTTCS.2011.28zbMath1246.94020OpenAlexW2160296932MaRDI QIDQ2911606

Joe Zimmerman, Deian Stefan, Alex D. Bain, Rahul Sharma, John C. Mitchell

Publication date: 31 August 2012

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


zbMATH Keywords

data integrationdata exchangeuniversal solutionsschema mappingsdatabase constraintshomomorphism dualities


Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)


Related Items (1)

EDSL


Uses Software

  • Haskell
  • Sharemind






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:2911606&oldid=15878569"
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 20:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki