369 search results - page 9 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
151
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
110
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
125
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
112
click to vote
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
123
click to vote
MOR
2000
15 years 1 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...