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
249
search results - page 3 / 50
»
Approximating the Bandwidth of Caterpillars
Sort
relevance
views
votes
recent
update
View
thumb
title
52
click to vote
ICALP
2009
Springer
124
views
Programming Languages
»
more
ICALP 2009
»
Exact and Approximate Bandwidth
15 years 4 months ago
Download
www.mimuw.edu.pl
Marek Cygan, Marcin Pilipczuk
claim paper
Read More »
67
click to vote
FOCS
1998
IEEE
118
views
Theoretical Computer Science
»
more
FOCS 1998
»
The Complexity of the Approximation of the Bandwidth Problem
15 years 1 months ago
Download
www.cs.ust.hk
d Abstract) Walter Unger Lehrstuhl f
Walter Unger
claim paper
Read More »
66
click to vote
SIGCOMM
1998
ACM
88
views
Communications
»
more
SIGCOMM 1998
»
Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks
15 years 1 months ago
Download
web.cs.wpi.edu
Ion Stoica, Scott Shenker, Hui Zhang
claim paper
Read More »
66
click to vote
FSTTCS
2000
Springer
98
views
Software Engineering
»
more
FSTTCS 2000
»
Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints
15 years 1 months ago
Download
www.dis.uniroma1.it
Stefano Leonardi, Alberto Marchetti-Spaccamela, An...
claim paper
Read More »
62
click to vote
RANDOM
2001
Springer
109
views
Theoretical Computer Science
»
more
RANDOM 2001
»
On Euclidean Embeddings and Bandwidth Minimization
15 years 1 months ago
Download
research.microsoft.com
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
John Dunagan, Santosh Vempala
claim paper
Read More »
« Prev
« First
page 3 / 50
Last »
Next »