Sciweavers

6 search results - page 1 / 2
» The Linear Arrangement Problem Parameterized Above Guarantee...
Sort
View
CIAC
2006
Springer
69views Algorithms» more  CIAC 2006»
13 years 10 months ago
The Linear Arrangement Problem Parameterized Above Guaranteed Value
Gregory Gutin, Arash Rafiey, Stefan Szeider, Ander...
IPL
2010
119views more  IPL 2010»
13 years 4 months ago
Note on Max Lin-2 above Average
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
Robert Crowston, Gregory Gutin, Mark Jones
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 6 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
FOCS
2009
IEEE
14 years 1 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
CSL
2004
Springer
13 years 11 months ago
Parameterized Model Checking of Ring-Based Message Passing Systems
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems,  ¢¡ , comprised of finite, but arbitrarily many,...
E. Allen Emerson, Vineet Kahlon