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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
31
click to vote
JCO
2000
favorite
Email
discuss
report
59
views
more
JCO 2000
»
Facets of an Assignment Problem with 0-1 Side Constraint
13 years 10 months ago
Download
deepblue.lib.umich.edu
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty
Real-time Traffic
Bipartite Graph
|
Incomlpete Bipartite Graph
|
Incomplete Bipartite Graph
|
JCO 2000
|
claim paper
Related Content
»
Approximability of Integer Programming with Generalised Constraints
»
Approximability of Clausal Constraints
»
Computational Complexity of Constraint Satisfaction
»
Online Square Packing
»
On Computing Pareto Stable Assignments
»
Bilateral timescaling for control of task freedoms of a constrained nonholonomic system
»
On Quadratic Threshold CSPs
»
Optimal online assignment with forecasts
»
On the complexity of schedule control problems for knockout tournaments
more »
Post Info
More Details (n/a)
Added
18 Dec 2010
Updated
18 Dec 2010
Type
Journal
Year
2000
Where
JCO
Authors
Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty
Comments
(0)
Researcher Info
JCO 2008 Study Group
Computer Vision