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
2
search results - page 1 / 1
»
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theo...
Sort
relevance
views
votes
recent
update
View
thumb
title
34
click to vote
FOCS
2004
IEEE
116
views
Theoretical Computer Science
»
more
FOCS 2004
»
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
14 years 1 months ago
Download
www.cs.toronto.edu
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
claim paper
Read More »
26
click to vote
COMBINATORICA
2007
99
views
more
COMBINATORICA 2007
»
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*
13 years 9 months ago
Download
www.cse.cuhk.edu.hk
Lap Chi Lau
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »