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
51
search results - page 11 / 11
»
Improved upper bounds for vertex cover
Sort
relevance
views
votes
recent
update
View
thumb
title
23
click to vote
SIGECOM
2011
ACM
232
views
ECommerce
»
more
SIGECOM 2011
»
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
12 years 9 months ago
Download
pages.cs.wisc.edu
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
claim paper
Read More »
« Prev
« First
page 11 / 11
Last »
Next »