Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Approve / Request updates on publications
Link opens in a new tab
English
עברית
العربية
Search content at Open University of Israel
Home
Researchers
Research units
Research outputs
Prizes
Activities
Approximating minimum-cost edge-covers of crossing biset-families
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximating minimum-cost edge-covers of crossing biset-families'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Approximability
33%
Directed Edge
66%
Edge
33%
Edge Cover
100%
Generic Algorithm
33%
Intersects
100%
NP-hard Problem
33%
Ordered Pair
33%
Ratio Formula
33%
Keyphrases
Approximation Algorithms
10%
Approximation Ratio
10%
Biset
100%
Directed Edges
20%
Edge Cover
100%
Generic Algorithm
10%
K-connected Graph
10%
K-regular
20%
Logarithmic Approximation
10%
Minimum Cost
100%
Network Design Problem
10%
NP-hard Problem
10%
Ordered Pair
10%
Primal-dual Algorithm
10%
X + Y
30%