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
3875
search results - page 20 / 775
»
Approximation Algorithms for the Max-coloring Problem
Sort
relevance
views
votes
recent
update
View
thumb
title
13
click to vote
RSA
2008
67
views
more
RSA 2008
»
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
13 years 7 months ago
Download
cs-www.cs.yale.edu
Petros Drineas, Ravi Kannan, Michael W. Mahoney
claim paper
Read More »
20
click to vote
TALG
2010
102
views
more
TALG 2010
»
An approximation algorithm for the maximum leaf spanning arborescence problem
13 years 5 months ago
Download
www.math.mcgill.ca
Matthew Drescher, Adrian Vetta
claim paper
Read More »
20
click to vote
DAM
2010
159
views
more
DAM 2010
»
Approximation algorithms for art gallery problems in polygons
13 years 4 months ago
Download
math.cts.ntu.edu.tw
Subir Kumar Ghosh
claim paper
Read More »
19
click to vote
ALGORITHMICA
2011
173
views
Artificial Intelligence
»
more
ALGORITHMICA 2011
»
Approximation Algorithms for k-hurdle Problems
13 years 2 months ago
Download
www.cs.clemson.edu
Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. ...
claim paper
Read More »
19
click to vote
STOC
1989
ACM
66
views
Algorithms
»
more
STOC 1989
»
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
13 years 11 months ago
Download
users.soe.ucsc.edu
Leonard Pitt, Manfred K. Warmuth
claim paper
Read More »
« Prev
« First
page 20 / 775
Last »
Next »