1274 search results - page 183 / 255 » Graph lambda theories |
128
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
138
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
117
click to vote
PERCOM
2004
ACM
16 years 1 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
156
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
118
click to vote
ICCAD
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...