Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
1486
search results - page 4 / 298
»
Algorithms for two-box covering
Sort
relevance
views
votes
recent
update
View
thumb
title
15
click to vote
CIKM
2010
Springer
144
views
Information Technology
»
more
CIKM 2010
»
Set cover algorithms for very large datasets
13 years 5 months ago
Download
dimacs.rutgers.edu
Graham Cormode, Howard J. Karloff, Anthony Wirth
claim paper
Read More »
31
click to vote
ESA
2011
Springer
242
views
Algorithms
»
more
ESA 2011
»
Cover-Decomposition and Polychromatic Numbers
12 years 7 months ago
Download
people.maths.ox.ac.uk
Béla Bollobás, David Pritchard, Thom...
claim paper
Read More »
24
click to vote
SODA
2012
ACM
185
views
Algorithms
»
more
SODA 2012
»
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
11 years 9 months ago
Download
cs.uwaterloo.ca
Timothy M. Chan, Elyot Grant, Jochen Könemann...
claim paper
Read More »
22
click to vote
CORR
2002
Springer
102
views
Education
»
more
CORR 2002
»
Tight Approximation Results for General Covering Integer Programs
13 years 7 months ago
Download
www.cs.ucr.edu
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
claim paper
Read More »
21
click to vote
JCO
2010
182
views
more
JCO 2010
»
Polynomial time approximation schemes for minimum disk cover problems
13 years 5 months ago
Download
www.ece.mtu.edu
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
claim paper
Read More »
« Prev
« First
page 4 / 298
Last »
Next »