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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
19
click to vote
FOCS
2005
IEEE
favorite
Email
discuss
report
91
views
Theoretical Computer Science
»
more
FOCS 2005
»
Additive Approximation for Edge-Deletion Problems
14 years 2 months ago
Download
www.math.tau.ac.il
Noga Alon, Asaf Shapira, Benny Sudakov
Real-time Traffic
FOCS 2005
|
Theoretical Computer Science
|
claim paper
Related Content
»
An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximatio...
»
Optimal Edge Deletions for Signed Graph Balancing
»
True costs of cheap labor are hard to measure edge deletion and VCG payments in graphs
»
DilationOptimal Edge Deletion in Polygonal Cycles
»
On Tractable Cases of Target Set Selection
»
New graph bipartizations for doubleexposure bright field alternating phaseshift mask layou...
»
Approximate Inference in Additive Factorial HMMs with Application to Energy Disaggregation
»
Maintaining a Large Matching or a Small Vertex Cover
»
Approximation algorithms via contraction decomposition
more »
Post Info
More Details (n/a)
Added
24 Jun 2010
Updated
24 Jun 2010
Type
Conference
Year
2005
Where
FOCS
Authors
Noga Alon, Asaf Shapira, Benny Sudakov
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision