1090 search results - page 46 / 218 » Priority Algorithms for Graph Optimization Problems |
120
Voted
ADHOCNOW
2008
Springer
15 years 8 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
131
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
118
click to vote
NIPS
2004
15 years 3 months ago
2004
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
131
click to vote
MP
2010
14 years 9 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
116
click to vote
ICALP
2000
Springer
15 years 5 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...