Pages that link to "Item:Q185429"
From MaRDI portal
The following pages link to Journal of Combinatorial Optimization (Q185429):
Displaying 50 items.
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- The multiple sequence sets: Problem and heuristic algorithms (Q411226) (← links)
- Optimal semi-online algorithm for scheduling with rejection on two uniform machines (Q411229) (← links)
- Super cyclically edge connected transitive graphs (Q411230) (← links)
- Optimal on-line algorithms for one batch machine with grouped processing times (Q411231) (← links)
- On the vertex characterization of single-shape partition polytopes (Q411234) (← links)
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- On domination number of Cartesian product of directed paths (Q411237) (← links)
- Polynomially solvable special cases of the quadratic bottleneck assignment problem (Q411238) (← links)
- A closest vector problem arising in radiation therapy planning (Q411241) (← links)
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Optimality conditions for a bilevel matroid problem (Q411248) (← links)
- Co-2-plex polynomials (Q411251) (← links)
- Improved floor-planning of graphs via adjacency-preserving transformations (Q411253) (← links)
- Selfish bin coloring (Q411255) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- Fast searching games on graphs (Q411259) (← links)
- A modified power spectral density test applied to weighing matrices with small weight (Q411261) (← links)
- Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262) (← links)
- Optimal algorithms for online time series search and one-way trading with interrelated prices (Q421255) (← links)
- Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
- The complexity of VLSI power-delay optimization by interconnect resizing (Q421260) (← links)
- Constructing weakly connected dominating set for secure clustering in distributed sensor network (Q421263) (← links)
- An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265) (← links)
- Analysis and approximation for bank selection instruction minimization on partitioned memory architecture (Q421269) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- An inverse approach to convex ordered median problems in trees (Q421273) (← links)
- The total \(\{k\}\)-domatic number of a graph (Q421274) (← links)
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs (Q421275) (← links)
- Constraint bipartite vertex cover: simpler exact algorithms and implementations (Q431922) (← links)
- Flattening topologically spherical surface (Q431923) (← links)
- Multi-bidding strategy in sponsored search auctions (Q431926) (← links)
- Tight bound for matching (Q431927) (← links)
- Estimating hybrid frequency moments of data streams (Q431931) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Independent dominating sets in triangle-free graphs (Q434189) (← links)
- On backbone coloring of graphs (Q434190) (← links)
- A new approach to solve open-partition problems (Q434191) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- The competition number of a graph with exactly two holes (Q434196) (← links)
- Acyclic chromatic indices of planar graphs with girth at least five (Q434197) (← links)
- Solving haplotype inference problem with non-genotyped founders via integer linear programming (Q434198) (← links)
- Improving an exact approach for solving separable integer quadratic knapsack problems (Q434199) (← links)
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks (Q434202) (← links)
- Special issue: Selected papers based on the presentations at the 4th international workshop on algorithms and computation (WALCOM 2010), Dhaka, Bangladesh, February 10--12, 2010 (Q436430) (← links)
- A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs (Q437046) (← links)
- Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks (Q437049) (← links)
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration (Q437051) (← links)
