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
2996
search results - page 600 / 600
»
Numberings and Randomness
Sort
relevance
views
votes
recent
update
View
thumb
title
34
click to vote
SIAMCOMP
2008
124
views
more
SIAMCOMP 2008
»
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
13 years 8 months ago
Download
pluto.huji.ac.il
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
claim paper
Read More »
« Prev
« First
page 600 / 600
Last »
Next »