Sciweavers

4131 search results - page 157 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
148
Voted
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 3 months ago
How to rank with few errors
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...
Claire Kenyon-Mathieu, Warren Schudy
132
Voted
MP
1998
134views more  MP 1998»
15 years 3 months ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang
118
Voted
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 3 months ago
Efficient Isomorphism Testing for a Class of Group Extensions
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
François Le Gall
SIAMCOMP
2010
125views more  SIAMCOMP 2010»
14 years 10 months ago
Approximating Steiner Networks with Node-Weights
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
Zeev Nutov
236
Voted
AMW
2011
14 years 7 months ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green