16843 search results - page 287 / 3369 » On Generalized Authorization Problems |
174
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
170
click to vote
COR
2006
15 years 6 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
165
click to vote
ESA
2007
Springer
16 years 23 days ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
207
click to vote
FAW
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
164
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...