2137 search results - page 99 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
124
click to vote
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
124
click to vote
WG
2009
Springer
15 years 8 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
124
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
114
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
116
Voted
JMLR
2010
14 years 9 months ago
2010
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...