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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
1433
search results - page 22 / 287
»
On Covering Problems of Rado
Sort
relevance
views
votes
recent
update
View
thumb
title
248
click to vote
ESCAPE
2007
Springer
350
views
Algorithms
»
more
ESCAPE 2007
»
An Approximation Algorithm for the General Mixed Packing and Covering Problem
16 years 3 days ago
Download
www.informatik.uni-kiel.de
Florian Diedrich, Klaus Jansen
claim paper
Read More »
109
click to vote
WAOA
2007
Springer
109
views
Algorithms
»
more
WAOA 2007
»
The Minimum Substring Cover Problem
16 years 2 days ago
Download
www.eng.tau.ac.il
Danny Hermelin, Dror Rawitz, Romeo Rizzi, St&eacut...
claim paper
Read More »
130
click to vote
AE
2005
Springer
87
views
Artificial Intelligence
»
more
AE 2005
»
A Cooperative Multilevel Tabu Search Algorithm for the Covering Design Problem
15 years 11 months ago
Download
www.crt.umontreal.ca
Chaoying Dai, Pak Ching Li, Michel Toulouse
claim paper
Read More »
119
click to vote
FSTTCS
2004
Springer
82
views
Software Engineering
»
more
FSTTCS 2004
»
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
15 years 11 months ago
Download
www.ulb.ac.be
Gilles Geeraerts, Jean-François Raskin, Lau...
claim paper
Read More »
198
click to vote
WAOA
2004
Springer
146
views
Algorithms
»
more
WAOA 2004
»
Approximation Algorithms for Mixed Fractional Packing and Covering Problems
15 years 11 months ago
Download
www.ceid.upatras.gr
Klaus Jansen
claim paper
Read More »
« Prev
« First
page 22 / 287
Last »
Next »