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 27 / 287
»
On Covering Problems of Rado
Sort
relevance
views
votes
recent
update
View
thumb
title
104
click to vote
CORR
2004
Springer
85
views
Education
»
more
CORR 2004
»
Long Range Frustrations in a Spin Glass Model of the Vertex Cover Problem
15 years 5 months ago
Download
power.itp.ac.cn
Haijun Zhou
claim paper
Read More »
114
click to vote
JCO
2000
39
views
more
JCO 2000
»
On Some Polyhedra Covering Problems
15 years 5 months ago
Download
www.iapmm.lviv.ua
Cao An Wang, Bo-Ting Yang, Binhai Zhu
claim paper
Read More »
114
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
15 years 5 months ago
Download
www.cs.uoi.gr
Katerina Asdre, Stavros D. Nikolopoulos
claim paper
Read More »
103
click to vote
MP
2010
79
views
more
MP 2010
»
MIP reformulations of the probabilistic set covering problem
15 years 4 months ago
Download
edoc.hu-berlin.de
Anureet Saxena, Vineet Goyal, Miguel A. Lejeune
claim paper
Read More »
257
click to vote
ACID
2006
220
views
Algorithms
»
more
ACID 2006
»
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
15 years 7 months ago
Download
www.dcs.gla.ac.uk
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
claim paper
Read More »
« Prev
« First
page 27 / 287
Last »
Next »