Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Partial multicuts in trees
Asaf Levin
*
,
Danny Segev
*
Corresponding author for this work
School of Mathematical Sciences
Hebrew University of Jerusalem
Research output
:
Contribution to journal
›
Article
›
peer-review
17
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Partial multicuts in trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Algorithms
100%
Lunate
66%
All-pairs
33%
Minimum Cost
33%
Lagrangian Relaxation
33%
Tree-based
33%
Approximation Factor
33%
2-approximation
33%
Strongly Polynomial
33%
Negative Cost
33%
LP-rounding
33%
Prize-collecting
33%
Undirected Tree
33%
Lagrangian multiplier
33%
Mathematics
Edge
100%
Tree Problem
100%
Polynomial
50%
Lagrangian
50%
Rounding
50%
Lagrangian Multiplier
50%
Computer Science
Approximation Algorithms
100%
Lagrangian Relaxation
33%
approximation factor
33%
Lagrangian Multiplier
33%