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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
116
click to vote
IPCO
1996
118
views
Optimization
»
more
IPCO 1996
»
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
15 years 4 months ago
Download
www.cs.ucr.edu
Sándor P. Fekete, Samir Khuller, Monika Kle
Real-time Traffic
IPCO 1996
|
IPCO 2007
|
claim paper
Related Content
»
Approximating minimum bounded degree spanning trees to within one of optimal
more »
Post Info
More Details (n/a)
Added
02 Nov 2010
Updated
02 Nov 2010
Type
Conference
Year
1996
Where
IPCO
Authors
Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
Comments
(0)
Researcher Info
Optimization Study Group
Computer Vision