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
1389
search results - page 10 / 278
»
Improved Approximation Algorithms for Label Cover Problems
Sort
relevance
views
votes
recent
update
View
thumb
title
47
click to vote
ESCAPE
2007
Springer
350
views
Algorithms
»
more
ESCAPE 2007
»
An Approximation Algorithm for the General Mixed Packing and Covering Problem
14 years 1 months ago
Download
www.informatik.uni-kiel.de
Florian Diedrich, Klaus Jansen
claim paper
Read More »
30
click to vote
WAOA
2004
Springer
146
views
Algorithms
»
more
WAOA 2004
»
Approximation Algorithms for Mixed Fractional Packing and Covering Problems
14 years 21 days ago
Download
www.ceid.upatras.gr
Klaus Jansen
claim paper
Read More »
20
click to vote
COCOON
2010
Springer
153
views
Combinatorics
»
more
COCOON 2010
»
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
13 years 11 months ago
Download
www.cse.psu.edu
Piotr Berman, Marek Karpinski, Andrzej Lingas
claim paper
Read More »
28
click to vote
FOCS
1991
IEEE
114
views
Theoretical Computer Science
»
more
FOCS 1991
»
Fast Approximation Algorithms for Fractional Packing and Covering Problems
13 years 11 months ago
Download
infolab.stanford.edu
Serge A. Plotkin, David B. Shmoys, Éva Tard...
claim paper
Read More »
22
click to vote
ESA
2001
Springer
132
views
Algorithms
»
more
ESA 2001
»
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
13 years 12 months ago
Download
www.csc.liv.ac.uk
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
claim paper
Read More »
« Prev
« First
page 10 / 278
Last »
Next »