Minimum perfect bipartite matchings and spanning trees under categorization
Discrete Applied Mathematics
The minimum labeling spanning trees
Information Processing Letters
Some Matching Problems for Bipartite Graphs
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Matchings in colored bipartite networks
Discrete Applied Mathematics
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On bottleneck assignment problems under categorization
Computers and Operations Research
The labeled perfect matching in bipartite graphs
Information Processing Letters
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Complexity of the min-max (regret) versions of cut problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation algorithms and hardness results for labeled connectivity problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Local search for the minimum label spanning tree problem with bounded color classes
Operations Research Letters
On two restricted ancestors tree problems
Information Processing Letters
Labeled Traveling Salesman Problems: Complexity and approximation
Discrete Optimization
| Hi-index | 0.00 |
We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long-established model partitions the set of edges into classes, each of which is identified by a unique color. The generic objective is to construct a subgraph of prescribed structure (such as that of being an s-t path, a spanning tree, or a perfect matching) while trying to avoid over-picking or under-picking edges from any given color.