4894 search results - page 773 / 979 » The Guarding Problem - Complexity and Approximation |
HPCC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...