Search results for "covering integer programs"

Found 14 publication records. Showing 14 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Hadas Shachnai, Oded Shmueli, Robert Sayegh	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints.	WAOA	2004	DBLP DOI BibTeX RDF
2	Sridhar Rajagopalan, Vijay V. Vazirani	Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs	FOCS	1993	DBLP DOI BibTeX RDF	randomized voting, primal-dual RNC approximation algorithms, covering integer programs, classical greedy sequential set cover algorithm, parallel approximation algorithms, randomization, set cover problem
1	Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh	Approximation schemes for deal splitting and covering integer programs with multiplicity constraints.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann	On Column-restricted and Priority Covering Integer Programs	CoRR	2010	DBLP BibTeX RDF
1	Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann	On Column-Restricted and Priority Covering Integer Programs.	IPCO	2010	DBLP DOI BibTeX RDF
1	David Pritchard	Approximability of Sparse Integer Programs.	ESA	2009	DBLP DOI BibTeX RDF
1	Aravind Srinivasan	Approximation algorithms for stochastic and risk-averse optimization.	SODA	2007	DBLP DOI BibTeX RDF
1	Anupam Gupta, Aravind Srinivasan	On the Covering Steiner Problem.	FSTTCS	2003	DBLP DOI BibTeX RDF
1	Stavros G. Kolliopoulos, Neal E. Young	Tight Approximation Results for General Covering Integer Programs	CoRR	2002	DBLP BibTeX RDF
1	Stavros G. Kolliopoulos, Neal E. Young	Tight Approximation Results for General Covering Integer Programs.	FOCS	2001	DBLP DOI BibTeX RDF
1	Philip M. Long	Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming.	WADS	2001	DBLP DOI BibTeX RDF
1	Aravind Srinivasan	Improved Approximation Guarantees for Packing and Covering Integer Programs.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Sridhar Rajagopalan, Vijay V. Vazirani	Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs.	SIAM J. Comput.	1998	DBLP DOI BibTeX RDF
1	Aravind Srinivasan, Chung-Piaw Teo	A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria.	STOC	1997	DBLP DOI BibTeX RDF	covering integer programs, discrete ham-sandwich theorems, rounding theorems, approximation algorithms, linear programming, randomized algorithms, packet routing, randomized rounding