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
1346
search results - page 270 / 270
»
Player-centred game design
Sort
relevance
views
votes
recent
update
View
thumb
title
28
click to vote
SODA
2012
ACM
217
views
Algorithms
»
more
SODA 2012
»
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
11 years 11 months ago
Download
www.cs.cmu.edu
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
claim paper
Read More »
« Prev
« First
page 270 / 270
Last »
Next »