3946 search results - page 499 / 790 » The computational complexity of choice sets |
132
click to vote
DAM
2006
15 years 6 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
170
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
152
click to vote
ORL
2008
15 years 6 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
154
Voted
IJFCS
2007
15 years 6 months ago
2007
Sense of direction is a property of the edge-labeling of a network whose availability facilitates computations and often decreases their complexity. In this paper we consider the ...
150
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...