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
16
search results - page 4 / 4
»
Approximating Maximum Weight Cycle Covers in Directed Graphs...
Sort
relevance
views
votes
recent
update
View
thumb
title
31
click to vote
ISAAC
2004
Springer
137
views
Algorithms
»
more
ISAAC 2004
»
The Polymatroid Steiner Problems
14 years 1 months ago
Download
www.cs.gsu.edu
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
claim paper
Read More »
« Prev
« First
page 4 / 4
Last »
Next »