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

scientific article; zbMATH DE number 871894

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

zbMath0845.90092MaRDI QIDQ4875163

Aravind Srinivasan

Publication date: 16 September 1996


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

zbMATH Keywords

minimaxcoveringpackingVLSI routingexistence of rare eventsNP-hard integer programsrandomized rounding of linear relaxations


Mathematics Subject Classification ID

Integer programming (90C10)


Related Items (9)

Local ratio method on partial set multi-cover ⋮ Unnamed Item ⋮ Geometric rounding: A dependent randomized rounding scheme ⋮ Approximating covering integer programs with multiplicity constraints ⋮ Approximation schemes for deal splitting and covering integer programs with multiplicity constraints ⋮ Improved parallel approximation of a class of integer programming problems ⋮ Approximation algorithm for partial positive influence problem in social network ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4521547 Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma] ⋮ Approximation algorithms for covering/packing integer programs







This page was built for publication:

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