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
1040
search results - page 12 / 208
»
Rounding algorithms for covering problems
Sort
relevance
views
votes
recent
update
View
thumb
title
14
click to vote
ALGORITHMICA
2008
59
views
more
ALGORITHMICA 2008
»
An Optimal Algorithm for the Minimum Disc Cover Problem
13 years 7 months ago
Download
cgm.cs.ntust.edu.tw
Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang...
claim paper
Read More »
16
click to vote
JCSS
2006
51
views
more
JCSS 2006
»
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
13 years 7 months ago
Download
www.ulb.ac.be
Gilles Geeraerts, Jean-François Raskin, Lau...
claim paper
Read More »
16
click to vote
NETWORKS
2007
77
views
Computer Networks
»
more
NETWORKS 2007
»
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
13 years 7 months ago
Download
www.cs.uoi.gr
Katerina Asdre, Stavros D. Nikolopoulos
claim paper
Read More »
19
click to vote
WAOA
2007
Springer
109
views
Algorithms
»
more
WAOA 2007
»
The Minimum Substring Cover Problem
14 years 1 months ago
Download
www.eng.tau.ac.il
Danny Hermelin, Dror Rawitz, Romeo Rizzi, St&eacut...
claim paper
Read More »
26
click to vote
ESA
2006
Springer
88
views
Algorithms
»
more
ESA 2006
»
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
13 years 11 months ago
Download
www.idsia.ch
Christoph Ambühl, Monaldo Mastrolilli
claim paper
Read More »
« Prev
« First
page 12 / 208
Last »
Next »