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
7015
search results - page 116 / 1403
»
Approximation algorithms for co-clustering
Sort
relevance
views
votes
recent
update
View
thumb
title
29
click to vote
FSTTCS
2000
Springer
98
views
Software Engineering
»
more
FSTTCS 2000
»
Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints
14 years 25 days ago
Download
www.dis.uniroma1.it
Stefano Leonardi, Alberto Marchetti-Spaccamela, An...
claim paper
Read More »
32
click to vote
FOCS
1991
IEEE
114
views
Theoretical Computer Science
»
more
FOCS 1991
»
Fast Approximation Algorithms for Fractional Packing and Covering Problems
14 years 22 days ago
Download
infolab.stanford.edu
Serge A. Plotkin, David B. Shmoys, Éva Tard...
claim paper
Read More »
23
click to vote
BIRTHDAY
2010
Springer
159
views
Applied Computing
»
more
BIRTHDAY 2010
»
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
13 years 11 months ago
Download
www.dcs.kcl.ac.uk
Maxime Crochemore, Costas S. Iliopoulos, Solon P. ...
claim paper
Read More »
26
click to vote
COCOA
2007
Springer
128
views
Discrete Geometry
»
more
COCOA 2007
»
Improved Approximation Algorithm for Connected Facility Location Problems
13 years 11 months ago
Download
tclab.kaist.ac.kr
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...
claim paper
Read More »
24
click to vote
COCOA
2008
Springer
117
views
Discrete Geometry
»
more
COCOA 2008
»
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
13 years 11 months ago
Download
tclab.kaist.ac.kr
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong C...
claim paper
Read More »
« Prev
« First
page 116 / 1403
Last »
Next »