Sciweavers

6740 search results - page 76 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
DISOPT
2008
89views more  DISOPT 2008»
13 years 10 months ago
A pricing problem under Monge property
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
Oktay Günlük
ICALP
2010
Springer
14 years 2 months ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot
CAS
2008
68views more  CAS 2008»
13 years 10 months ago
Very Strongly Constrained Problems: an Ant Colony Optimization Approach
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
Vittorio Maniezzo, Matteo Roffilli
ESA
2009
Springer
74views Algorithms» more  ESA 2009»
14 years 4 months ago
On Inducing Polygons and Related Problems
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc ...
IJCAI
1989
13 years 11 months ago
Reconstructive Explanation: Explanation as Complex Problem Solving
Existing explanation facilities are typically far more appropriate for knowledge engineers engaged in system maintenance than for endusers of the system. This is because the expla...
Michael R. Wick, William B. Thompson