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
4843
search results - page 51 / 969
»
The Shortcut Problem - Complexity and Approximation
Sort
relevance
views
votes
recent
update
View
thumb
title
19
click to vote
FOCS
1998
IEEE
81
views
Theoretical Computer Science
»
more
FOCS 1998
»
Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
14 years 1 months ago
Download
www.ccs.neu.edu
Kamal Jain
claim paper
Read More »
30
click to vote
CPM
1997
Springer
111
views
Combinatorics
»
more
CPM 1997
»
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
14 years 29 days ago
Download
www.csc.liv.ac.uk
Mary Cryan, Leslie Ann Goldberg, Cynthia A. Philli...
claim paper
Read More »
25
click to vote
ISAAC
1993
Springer
106
views
Algorithms
»
more
ISAAC 1993
»
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
14 years 26 days ago
Download
www.cs.gsu.edu
Ulrich Fößmeier, Michael Kaufmann, Alex...
claim paper
Read More »
22
click to vote
STOC
1994
ACM
97
views
Algorithms
»
more
STOC 1994
»
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
14 years 26 days ago
Download
www.cs.uwaterloo.ca
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
Naveen Garg, Dorit S. Hochbaum
claim paper
Read More »
24
click to vote
STOC
1989
ACM
66
views
Algorithms
»
more
STOC 1989
»
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
14 years 25 days ago
Download
users.soe.ucsc.edu
Leonard Pitt, Manfred K. Warmuth
claim paper
Read More »
« Prev
« First
page 51 / 969
Last »
Next »