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
17
click to vote
NETWORKS
2010
118
views
Computer Networks
»
more
NETWORKS 2010
»
The regenerator location problem
13 years 7 months ago
Download
telecom.section.informs.org
Si Chen, Ivana Ljubic, S. Raghavan
claim paper
Read More »
24
click to vote
NETWORKS
2010
178
views
Computer Networks
»
more
NETWORKS 2010
»
A branch-and-cut algorithm for partition coloring
13 years 7 months ago
Download
www.ic.uff.br
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
claim paper
Read More »
« first
‹ previous
1
2
3