743 search results - page 51 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
111
click to vote
FSTTCS
2010
Springer
15 years 5 days ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
125
click to vote
COCOA
2009
Springer
15 years 5 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
146
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
107
click to vote
INFORMS
2008
15 years 2 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
127
Voted
ICDE
2009
IEEE
15 years 9 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...