Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Approximating minimum feedback sets and multicuts in directed graphs
G. Even
, J. Naor
,
B. Schieber
, M. Sudan
Research output
:
Contribution to journal
›
Article
›
peer-review
248
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximating minimum feedback sets and multicuts in directed graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Directed Graph
100%
Feedback Edge Set
100%
Feedback Set
100%
Log-log
66%
Feedback Vertex Set
50%
Approximate Solution
33%
Approximation Factor
33%
Feedback Vertex Set Problem
33%
Directed Cycle
33%
NP-hard
16%
Total Weight
16%
Linear Programming Method
16%
Number of Vertices
16%
Approximation Algorithms
16%
NP-hard Problem
16%
Optimal Feedback
16%
Directed Networks
16%
Combinatorial Algorithms
16%
Fractional Solutions
16%
Circular Network
16%
Mathematics
Edge
100%
Approximate Solution
22%
Intersects
22%
Directed Cycle
22%
Total Weight
11%
NP-hard Problem
11%
Linear Programming
11%
Combinatorial Algorithm
11%