Sciweavers

2 search results - page 1 / 1
» Multi.Objective Hypergraph Partitioning Algorithms for Cut a...
Sort
View
ICCAD
2003
IEEE
148views Hardware» more  ICCAD 2003»
14 years 1 months ago
Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both th...
Navaratnasothie Selvakkumaran, George Karypis
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 5 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...