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
107
click to vote
JCSS
2008
63
views
more
JCSS 2008
»
Approximation of satisfactory bisection problems
15 years 2 months ago
Download
www.lamsade.dauphine.fr
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Real-time Traffic
JCSS 2008
|
claim paper
Related Content
»
A polylogarithmic approximation of the minimum bisection
»
Complexity and Approximation of Satisfactory Partition Problems
»
On Approximability of Minimum Bisection Problem
»
A Note on Approximating MAXBISECTION on Regular Graphs
»
A Comparative Study of Linear and Semidefinite BranchandCut Methods for Solving the Minimu...
»
Approximation schemes for Metric Bisection and partitioning
»
Polynomial time approximation schemes for dense instances of NPhard problems
»
Balanced graph partitioning
»
Farthest Centroids Divisive Clustering
more »
Post Info
More Details (n/a)
Added
13 Dec 2010
Updated
13 Dec 2010
Type
Journal
Year
2008
Where
JCSS
Authors
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Comments
(0)
Researcher Info
JCSS 2008 Study Group
Computer Vision