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
281
search results - page 57 / 57
»
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Sort
relevance
views
votes
recent
update
View
thumb
title
19
click to vote
FOCS
2008
IEEE
192
views
Theoretical Computer Science
»
more
FOCS 2008
»
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
13 years 11 months ago
Download
www.cs.princeton.edu
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
claim paper
Read More »
« Prev
« First
page 57 / 57
Last »
Next »