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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
11
search results - page 3 / 3
»
Compressing Large Boolean Matrices using Reordering Techniqu...
Sort
relevance
views
votes
recent
update
View
thumb
title
124
Voted
STACS
2005
Springer
94
views
Theoretical Computer Science
»
more
STACS 2005
»
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
15 years 8 months ago
Download
cs-www.cs.yale.edu
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
claim paper
Read More »
« Prev
« First
page 3 / 3
Last »
Next »