Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is NP-Complete

Encyclopedia of Internet Technologies and Applications
This definition means that there is not an algorithm that is able to find a feasible solution that satisfies both constraints in polynomial time.
Published in Chapter:
Quality of Service Routing
Marília Curado (CISUC/DEI, Portugal)
Copyright: © 2008 |Pages: 7
DOI: 10.4018/978-1-59140-993-9.ch063
Traditionally, Internet routing is achieved through shortest path protocols that base their decision on the number of hops or administrative metrics. The path computation algorithms belong either to the distance vector or link state families. Distance vector protocols have been widely used on the Internet since the ARPANET and remain in use today. The protocols of the Distance Vector family are used by routers to exchange routing information with their neighbours and to select the shortest paths to all destinations within the network using the Bellman-Ford algorithm, such as in the routing information protocol (RIP) (Malkin, 1998).
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Experimental Analysis with Variable Neighborhood Search for Discrete Optimization Problems
Well-known as intractable problems, are the hardest problems classified by the complexity theory. Therefore, there is no known exact algorithm that solve them in all their instances, thus it is necessary to use heuristic methods to find high-quality solutions in a reasonable computational time.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR