4118 search results - page 270 / 824 » Efficient Algorithms for Airline Problem |
140
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
119
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
210
Voted
GIS
2004
ACM
16 years 5 months ago
2004
ACM
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
140
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
144
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...