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
2
search results - page 1 / 1
»
An Improved Analysis for a Greedy Remote-Clique Algorithm Us...
Sort
relevance
views
votes
recent
update
View
thumb
title
16
click to vote
APPROX
2006
Springer
72
views
Algorithms
»
more
APPROX 2006
»
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
13 years 11 months ago
Download
www.cs.washington.edu
Benjamin E. Birnbaum, Kenneth J. Goldman
claim paper
Read More »
24
click to vote
FCT
2007
Springer
123
views
Applied Computing
»
more
FCT 2007
»
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
14 years 1 months ago
Download
www.ceid.upatras.gr
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »