Sciweavers

1404 search results - page 35 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ICLP
2010
Springer
15 years 1 months ago
Using Generalized Annotated Programs to Solve Social Network Optimization Problems
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
Paulo Shakarian, V. S. Subrahmanian, Maria Luisa S...
ACSAC
2008
IEEE
15 years 4 months ago
The Role Hierarchy Mining Problem: Discovery of Optimal Role Hierarchies
Role hierarchies are fundamental to the role based access control (RBAC) model. The notion of role hierarchy is a well understood concept that allows senior roles to inherit the p...
Qi Guo, Jaideep Vaidya, Vijayalakshmi Atluri
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
14 years 11 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 1 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
TALG
2008
97views more  TALG 2008»
14 years 9 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon