Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
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
Computer Science
Approximation Algorithms
100%
Approximation Ratio
100%
Network Design Problem
100%
Connected Subgraph
100%
Logarithmic Approximation
100%
Primal-Dual
100%
Generic Algorithm
100%
Mathematics
Intersects
100%
Edge Cover
100%
Directed Edge
66%
Edge
33%
Approximability
33%
NP-hard Problem
33%
Ordered Pair
33%
Generic Algorithm
33%
Ratio Formula
33%
Keyphrases
Edge Cover
100%
Minimum Cost
100%
Biset
100%
X + Y
30%
Directed Edges
20%
K-regular
20%
Approximation Algorithms
10%
Network Design Problem
10%
Approximation Ratio
10%
NP-hard Problem
10%
K-connected Graph
10%
Logarithmic Approximation
10%
Primal-dual Algorithm
10%
Ordered Pair
10%
Generic Algorithm
10%