840 search results - page 146 / 168 » Inapproximability of Combinatorial Optimization Problems |
GEOINFORMATICA
2002
13 years 9 months ago
2002
The generation of better label placement configurations in maps is a problem that comes up in automated cartographic production. The objective of a good label placement is to displ...
TROB
2002
2002
DPAC: an object-oriented distributed and parallel computing framework for manufacturing applications
13 years 9 months ago
Parallel and distributed computing infrastructure are increasingly being embraced in the context of manufacturing applications, including real-time scheduling. In this paper, we pr...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
ICAI
2004
13 years 11 months ago
2004
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
IJCAI
1997
13 years 11 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...